%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : COM007+2 : TPTP v9.3.1. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% Computer : n015.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Fri Sep 25 01:04:17 PM UTC 2026
% Result : Theorem 2.32s 1.27s
% Output : CNFRefutation 2.32s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 7
% Syntax : Number of formulae : 54 ( 15 unt; 0 def)
% Number of atoms : 120 ( 20 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 117 ( 51 ~; 54 |; 7 &)
% ( 0 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 5 ( 3 usr; 2 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 66 ( 0 sgn 63 !; 3 ?; 20 :)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
( reflexive_rewrite(a,c)
& reflexive_rewrite(a,b) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',assumption) ).
fof(f2,axiom,
! [X0] :
( ( reflexive_rewrite(c,X0)
& reflexive_rewrite(b,X0) )
=> goal ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goal_ax) ).
fof(f3,axiom,
! [X0,X1] :
( X0 = X1
=> reflexive_rewrite(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',equal_in_reflexive_rewrite) ).
fof(f4,axiom,
! [X0,X1] :
( rewrite(X0,X1)
=> reflexive_rewrite(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rewrite_in_reflexive_rewrite) ).
fof(f5,axiom,
! [X0,X1] :
( reflexive_rewrite(X0,X1)
=> ( rewrite(X0,X1)
| X0 = X1 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',equal_or_rewrite) ).
fof(f6,axiom,
! [X0,X1,X2] :
( ( rewrite(X0,X2)
& rewrite(X0,X1) )
=> ? [X3] :
( rewrite(X2,X3)
& rewrite(X1,X3) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rewrite_diamond) ).
fof(f7,conjecture,
goal,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goal_to_be_proved) ).
fof(f8,negated_conjecture,
~ goal,
inference(negated_conjecture,[status(cth)],[f7]) ).
fof(f9,plain,
~ goal,
inference(flattening,[],[f8]) ).
fof(f10,plain,
! [X0] :
( ~ reflexive_rewrite(c,X0)
| ~ reflexive_rewrite(b,X0)
| goal ),
inference(ennf_transformation,[],[f2]) ).
fof(f11,plain,
! [X0] :
( ~ reflexive_rewrite(c,X0)
| ~ reflexive_rewrite(b,X0)
| goal ),
inference(flattening,[],[f10]) ).
fof(f12,plain,
! [X0,X1] :
( X0 != X1
| reflexive_rewrite(X0,X1) ),
inference(ennf_transformation,[],[f3]) ).
fof(f13,plain,
! [X0,X1] :
( ~ rewrite(X0,X1)
| reflexive_rewrite(X0,X1) ),
inference(ennf_transformation,[],[f4]) ).
fof(f14,plain,
! [X0,X1] :
( ~ reflexive_rewrite(X0,X1)
| rewrite(X0,X1)
| X0 = X1 ),
inference(ennf_transformation,[],[f5]) ).
fof(f15,plain,
! [X0,X1] :
( ~ reflexive_rewrite(X0,X1)
| rewrite(X0,X1)
| X0 = X1 ),
inference(flattening,[],[f14]) ).
fof(f16,plain,
! [X0,X1,X2] :
( ~ rewrite(X0,X2)
| ~ rewrite(X0,X1)
| ? [X3] :
( rewrite(X2,X3)
& rewrite(X1,X3) ) ),
inference(ennf_transformation,[],[f6]) ).
fof(f17,plain,
! [X0,X1,X2] :
( ~ rewrite(X0,X2)
| ~ rewrite(X0,X1)
| ? [X3] :
( rewrite(X2,X3)
& rewrite(X1,X3) ) ),
inference(flattening,[],[f16]) ).
fof(f18,plain,
! [X0,X1,X2] :
( ~ rewrite(X0,X2)
| ~ rewrite(X0,X1)
| ( rewrite(X2,sK0(X1,X2))
& rewrite(X1,sK0(X1,X2)) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X3,sK0(X1,X2))],[f17]) ).
fof(f19,plain,
reflexive_rewrite(a,c),
inference(cnf_transformation,[],[f1]) ).
fof(f20,plain,
reflexive_rewrite(a,b),
inference(cnf_transformation,[],[f1]) ).
fof(f21,plain,
! [X0] :
( ~ reflexive_rewrite(c,X0)
| ~ reflexive_rewrite(b,X0)
| goal ),
inference(cnf_transformation,[],[f11]) ).
fof(f22,plain,
! [X0,X1] :
( X0 != X1
| reflexive_rewrite(X0,X1) ),
inference(cnf_transformation,[],[f12]) ).
fof(f23,plain,
! [X0,X1] :
( ~ rewrite(X0,X1)
| reflexive_rewrite(X0,X1) ),
inference(cnf_transformation,[],[f13]) ).
fof(f24,plain,
! [X0,X1] :
( ~ reflexive_rewrite(X0,X1)
| rewrite(X0,X1)
| X0 = X1 ),
inference(cnf_transformation,[],[f15]) ).
fof(f25,plain,
! [X2,X0,X1] :
( ~ rewrite(X0,X2)
| ~ rewrite(X0,X1)
| rewrite(X2,sK0(X1,X2)) ),
inference(cnf_transformation,[],[f18]) ).
fof(f26,plain,
! [X2,X0,X1] :
( ~ rewrite(X0,X2)
| ~ rewrite(X0,X1)
| rewrite(X1,sK0(X1,X2)) ),
inference(cnf_transformation,[],[f18]) ).
fof(f27,plain,
~ goal,
inference(cnf_transformation,[],[f9]) ).
fof(f28,plain,
! [X1] : reflexive_rewrite(X1,X1),
inference(equality_resolution,[],[f22]) ).
tcf(c_49,plain,
reflexive_rewrite(a,b),
inference(cnf_transformation,[],[f20]) ).
tcf(c_50,plain,
reflexive_rewrite(a,c),
inference(cnf_transformation,[],[f19]) ).
tcf(c_51,plain,
! [X0: $i] :
( goal
| ~ reflexive_rewrite(c,X0)
| ~ reflexive_rewrite(b,X0) ),
inference(cnf_transformation,[],[f21]) ).
tcf(c_52,plain,
! [X0: $i] : reflexive_rewrite(X0,X0),
inference(cnf_transformation,[],[f28]) ).
tcf(c_53,plain,
! [X0: $i,X1: $i] :
( reflexive_rewrite(X0,X1)
| ~ rewrite(X0,X1) ),
inference(cnf_transformation,[],[f23]) ).
tcf(c_54,plain,
! [X0: $i,X1: $i] :
( rewrite(X0,X1)
| ( X0 = X1 )
| ~ reflexive_rewrite(X0,X1) ),
inference(cnf_transformation,[],[f24]) ).
tcf(c_55,plain,
! [X0: $i,X1: $i,X2: $i] :
( rewrite(X1,sK0(X1,X2))
| ~ rewrite(X0,X2)
| ~ rewrite(X0,X1) ),
inference(cnf_transformation,[],[f26]) ).
tcf(c_56,plain,
! [X0: $i,X1: $i,X2: $i] :
( rewrite(X2,sK0(X1,X2))
| ~ rewrite(X0,X2)
| ~ rewrite(X0,X1) ),
inference(cnf_transformation,[],[f25]) ).
tcf(c_57,negated_conjecture,
~ goal,
inference(cnf_transformation,[],[f27]) ).
tcf(c_62,plain,
! [X0: $i] :
( ~ reflexive_rewrite(b,X0)
| ~ reflexive_rewrite(c,X0) ),
inference(global_subsumption_just,[status(thm)],[c_51,c_57,c_51]) ).
tcf(c_63,plain,
! [X0: $i] :
( ~ reflexive_rewrite(c,X0)
| ~ reflexive_rewrite(b,X0) ),
inference(renaming,[status(thm)],[c_62]) ).
tcf(c_312,plain,
~ reflexive_rewrite(c,b),
inference(superposition,[status(thm)],[c_52,c_63]) ).
tcf(c_319,plain,
( rewrite(a,b)
| ( a = b ) ),
inference(superposition,[status(thm)],[c_49,c_54]) ).
tcf(c_320,plain,
( rewrite(a,c)
| ( a = c ) ),
inference(superposition,[status(thm)],[c_50,c_54]) ).
tcf(c_337,plain,
! [X0: $i] :
( rewrite(b,sK0(b,X0))
| ( a = b )
| ~ rewrite(a,X0) ),
inference(superposition,[status(thm)],[c_319,c_55]) ).
tcf(c_348,plain,
! [X0: $i] :
( rewrite(X0,sK0(b,X0))
| ( a = b )
| ~ rewrite(a,X0) ),
inference(superposition,[status(thm)],[c_319,c_56]) ).
tcf(c_376,plain,
! [X0: $i] :
( reflexive_rewrite(b,sK0(b,X0))
| ( a = b )
| ~ rewrite(a,X0) ),
inference(superposition,[status(thm)],[c_337,c_53]) ).
tcf(c_399,plain,
! [X0: $i] :
( reflexive_rewrite(X0,sK0(b,X0))
| ( a = b )
| ~ rewrite(a,X0) ),
inference(superposition,[status(thm)],[c_348,c_53]) ).
tcf(c_473,plain,
! [X0: $i] :
( ( a = b )
| ~ rewrite(a,X0)
| ~ reflexive_rewrite(c,sK0(b,X0)) ),
inference(superposition,[status(thm)],[c_376,c_63]) ).
tcf(c_536,plain,
( ( a = b )
| ~ rewrite(a,c) ),
inference(superposition,[status(thm)],[c_399,c_473]) ).
tcf(c_550,plain,
( ( a = c )
| ( a = b ) ),
inference(superposition,[status(thm)],[c_320,c_536]) ).
tcf(c_575,plain,
( ( a = b )
| ~ reflexive_rewrite(a,b) ),
inference(superposition,[status(thm)],[c_550,c_312]) ).
tcf(c_577,plain,
a = b,
inference(forward_subsumption_resolution,[status(thm)],[c_575,c_49]) ).
tcf(c_579,plain,
! [X0: $i] :
( ~ reflexive_rewrite(c,X0)
| ~ reflexive_rewrite(a,X0) ),
inference(demodulation,[status(thm)],[c_63,c_577]) ).
tcf(c_587,plain,
~ reflexive_rewrite(a,c),
inference(superposition,[status(thm)],[c_52,c_579]) ).
tcf(c_590,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_587,c_50]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : COM007+2 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.11/0.36 % Computer : n015.cluster.edu
% 0.11/0.36 % Model : x86_64 x86_64
% 0.11/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.36 % Memory : 8046.5625MB
% 0.11/0.36 % OS : Linux 6.8.0-71-generic
% 0.11/0.36 % CPULimit : 300
% 0.11/0.36 % WCLimit : 300
% 0.11/0.36 % DateTime : Fri Sep 25 07:47:57 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.37 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.11/0.40 Running first-order theorem proving
% 0.11/0.40 Running: /export/starexec/sandbox2/solver/bin/iproveropt-multi-core.sh -d -n -l tptp -s fof_schedule -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.11/0.42
% 0.11/0.42 % ======== iProver multi-core TPTP/SMT =========
% 0.11/0.42
% 0.11/0.42 % Detected problem language: tptp
% 0.11/0.43 % Proving...
% 2.32/1.27 % SZS status Started for theBenchmark.p
% 2.32/1.27 % SZS status Theorem for theBenchmark.p
% 2.32/1.27
% 2.32/1.27 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 2.32/1.27
% 2.32/1.27 % ------ iProver source info
% 2.32/1.27
% 2.32/1.27 % git: date: 2026-07-19 20:42:38 +0200
% 2.32/1.27 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 2.32/1.27 % git: non_committed_changes: false
% 2.32/1.27
% 2.32/1.27 % ------ Parsing...
% 2.32/1.27 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 2.32/1.27
% 2.32/1.27 % ------ Preprocessing... sup_sim: 0 sf_s rm: 2 0s sf_e pe_s pe_e sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e %
% 2.32/1.27
% 2.32/1.27 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 2.32/1.27
% 2.32/1.27 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 2.32/1.27 % ------ Proving...
% 2.32/1.27 % ------ Problem Properties
% 2.32/1.27
% 2.32/1.27 %
% 2.32/1.27 % clauses 8
% 2.32/1.27 % conjectures 0
% 2.32/1.27 % EPR 6
% 2.32/1.27 % Horn 7
% 2.32/1.27 % unary 3
% 2.32/1.27 % binary 2
% 2.32/1.27 % lits 16
% 2.32/1.27 % lits eq 1
% 2.32/1.27 % fd_pure 0
% 2.32/1.27 % fd_pseudo 0
% 2.32/1.27 % fd_cond 0
% 2.32/1.27 % fd_pseudo_cond 1
% 2.32/1.27 % AC symbols 0
% 2.32/1.27
% 2.32/1.27 % ------ Schedule dynamic 5 is on
% 2.32/1.27
% 2.32/1.27 % ------ no conjectures: strip conj schedule
% 2.32/1.27
% 2.32/1.27 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" stripped conjectures Time Limit: 10.
% 2.32/1.27
% 2.32/1.27
% 2.32/1.27 % ------
% 2.32/1.27 % Current options:
% 2.32/1.27 % ------
% 2.32/1.27
% 2.32/1.27
% 2.32/1.27 %
% 2.32/1.27
% 2.32/1.27 % ------ Proving...
% 2.32/1.27 %
% 2.32/1.27
% 2.32/1.27 % SZS status Theorem for theBenchmark.p
% 2.32/1.27
% 2.32/1.27 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.32/1.28
% 2.32/1.28
%------------------------------------------------------------------------------