%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : COM007+1 : TPTP v9.3.1. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n006.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 : Thu Sep 24 12:11:25 PM UTC 2026
% Result : Theorem 0.14s 0.47s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 10
% Syntax : Number of formulae : 47 ( 14 unt; 0 def)
% Number of atoms : 105 ( 0 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 104 ( 46 ~; 45 |; 6 &)
% ( 0 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 2 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-3 aty)
% Number of variables : 70 ( 0 sgn 32 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(goal_to_be_proved,conjecture,
goal,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goal_to_be_proved) ).
fof(goal_ax,axiom,
! [X1] :
( ( reflexive_rewrite(c,X1)
& reflexive_rewrite(b,X1) )
=> goal ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goal_ax) ).
fof(rewrite_in_reflexive_rewrite,axiom,
! [X1,X2] :
( rewrite(X1,X2)
=> reflexive_rewrite(X1,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rewrite_in_reflexive_rewrite) ).
fof(rewrite_diamond,axiom,
! [X1,X2,X3] :
( ( rewrite(X1,X3)
& rewrite(X1,X2) )
=> ? [X4] :
( rewrite(X3,X4)
& rewrite(X2,X4) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rewrite_diamond) ).
fof(symmtery,axiom,
! [X1,X2] :
( equalish(X1,X2)
=> equalish(X2,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',symmtery) ).
fof(equalish_or_rewrite,axiom,
! [X1,X2] :
( reflexive_rewrite(X1,X2)
=> ( rewrite(X1,X2)
| equalish(X1,X2) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',equalish_or_rewrite) ).
fof(substitution,axiom,
! [X1,X2,X3] :
( ( reflexive_rewrite(X2,X3)
& equalish(X1,X2) )
=> reflexive_rewrite(X1,X3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',substitution) ).
fof(equalish_in_reflexive_rewrite,axiom,
! [X1,X2] :
( equalish(X1,X2)
=> reflexive_rewrite(X1,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',equalish_in_reflexive_rewrite) ).
fof(reflexivity,axiom,
! [X1] : equalish(X1,X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',reflexivity) ).
fof(assumption,axiom,
( reflexive_rewrite(a,c)
& reflexive_rewrite(a,b) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',assumption) ).
fof(c_0_10,negated_conjecture,
~ goal,
inference(assume_negation,[status(cth)],[goal_to_be_proved]) ).
fof(c_0_11,negated_conjecture,
~ goal,
inference(fof_simplification,[status(thm)],[c_0_10]) ).
fof(c_0_12,plain,
! [X5] :
( goal
| ~ reflexive_rewrite(c,X5)
| ~ reflexive_rewrite(b,X5) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[goal_ax])])]) ).
fof(c_0_13,negated_conjecture,
~ goal,
inference(fof_nnf,[status(thm)],[c_0_11]) ).
fof(c_0_14,plain,
! [X14,X15] :
( reflexive_rewrite(X14,X15)
| ~ rewrite(X14,X15) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[rewrite_in_reflexive_rewrite])])]) ).
fof(c_0_15,plain,
! [X18,X19,X20] :
( ( ~ rewrite(X18,X20)
| ~ rewrite(X18,X19)
| rewrite(X20,esk1_3(X18,X19,X20)) )
& ( ~ rewrite(X18,X20)
| ~ rewrite(X18,X19)
| rewrite(X19,esk1_3(X18,X19,X20)) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[rewrite_diamond])])])])]) ).
fof(c_0_16,plain,
! [X7,X8] :
( equalish(X8,X7)
| ~ equalish(X7,X8) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[symmtery])])]) ).
fof(c_0_17,plain,
! [X16,X17] :
( rewrite(X16,X17)
| equalish(X16,X17)
| ~ reflexive_rewrite(X16,X17) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[equalish_or_rewrite])])]) ).
cnf(c_0_18,plain,
( ~ reflexive_rewrite(c,X1)
| ~ reflexive_rewrite(b,X1)
| goal ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_19,negated_conjecture,
~ goal,
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_20,plain,
( ~ rewrite(X1,X2)
| reflexive_rewrite(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_21,plain,
( ~ rewrite(X2,X1)
| ~ rewrite(X2,X3)
| rewrite(X1,esk1_3(X2,X3,X1)) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
fof(c_0_22,plain,
! [X9,X10,X11] :
( reflexive_rewrite(X9,X11)
| ~ reflexive_rewrite(X10,X11)
| ~ equalish(X9,X10) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[substitution])])]) ).
cnf(c_0_23,plain,
( ~ equalish(X1,X2)
| equalish(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_24,plain,
( ~ reflexive_rewrite(X1,X2)
| rewrite(X1,X2)
| equalish(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_25,plain,
( ~ reflexive_rewrite(c,X1)
| ~ reflexive_rewrite(b,X1) ),
inference(sr,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_26,plain,
( ~ rewrite(X2,X1)
| ~ rewrite(X2,X3)
| reflexive_rewrite(X1,esk1_3(X2,X3,X1)) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_27,plain,
( ~ rewrite(X2,X3)
| ~ rewrite(X2,X1)
| rewrite(X1,esk1_3(X2,X1,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_28,plain,
( ~ reflexive_rewrite(X2,X3)
| ~ equalish(X1,X2)
| reflexive_rewrite(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_29,plain,
( ~ reflexive_rewrite(X1,X2)
| equalish(X2,X1)
| rewrite(X1,X2) ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
fof(c_0_30,plain,
! [X12,X13] :
( reflexive_rewrite(X12,X13)
| ~ equalish(X12,X13) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[equalish_in_reflexive_rewrite])])]) ).
fof(c_0_31,plain,
! [X6] : equalish(X6,X6),
inference(variable_rename,[status(thm)],[reflexivity]) ).
cnf(c_0_32,plain,
( ~ reflexive_rewrite(b,esk1_3(X1,X2,c))
| ~ rewrite(X1,X2)
| ~ rewrite(X1,c) ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_33,plain,
( ~ rewrite(X2,X1)
| ~ rewrite(X2,X3)
| reflexive_rewrite(X1,esk1_3(X2,X1,X3)) ),
inference(spm,[status(thm)],[c_0_20,c_0_27]) ).
cnf(c_0_34,plain,
( ~ reflexive_rewrite(X1,X2)
| ~ reflexive_rewrite(X1,X3)
| reflexive_rewrite(X2,X3)
| rewrite(X1,X2) ),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_35,plain,
reflexive_rewrite(a,b),
inference(split_conjunct,[status(thm)],[assumption]) ).
cnf(c_0_36,plain,
( ~ equalish(X1,X2)
| reflexive_rewrite(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_37,plain,
equalish(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
cnf(c_0_38,plain,
( ~ rewrite(X1,b)
| ~ rewrite(X1,c) ),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_39,plain,
( ~ reflexive_rewrite(a,X1)
| reflexive_rewrite(X1,b)
| rewrite(a,X1) ),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_40,plain,
reflexive_rewrite(a,c),
inference(split_conjunct,[status(thm)],[assumption]) ).
cnf(c_0_41,plain,
reflexive_rewrite(X1,X1),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_42,plain,
( ~ rewrite(a,b)
| reflexive_rewrite(c,b) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_40])]) ).
cnf(c_0_43,plain,
( ~ reflexive_rewrite(a,X1)
| reflexive_rewrite(X1,c)
| rewrite(a,X1) ),
inference(spm,[status(thm)],[c_0_34,c_0_40]) ).
cnf(c_0_44,plain,
~ reflexive_rewrite(b,c),
inference(spm,[status(thm)],[c_0_25,c_0_41]) ).
cnf(c_0_45,plain,
reflexive_rewrite(c,b),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43]),c_0_35])]),c_0_44]) ).
cnf(c_0_46,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_45]),c_0_41])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : COM007+1 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.37 % Computer : n006.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Mon Sep 21 14:13:27 UTC 2026
% 0.10/0.38 % CPUTime :
% 0.10/0.38 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.14/0.43 Running first-order theorem proving
% 0.14/0.43 Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.14/0.47 % Version: 3.5.1
% 0.14/0.47 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/0.47 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.47 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/0.47 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.47 % Starting new_bool_1 with 300s (1) cores
% 0.14/0.47 % Starting sh5l with 300s (1) cores
% 0.14/0.47 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 3047133 completed with status 0
% 0.14/0.47 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.14/0.47 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/0.47 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.47 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/0.47 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.14/0.47 % No SInE strategy applied
% 0.14/0.47 % Search class: FGUNF-FFSF33-SFFFFFNN
% 0.14/0.47 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.14/0.47 % Starting SubtermCWHack with 136s (1) cores
% 0.14/0.47 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.14/0.47 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.14/0.47 % Starting new_bool_3 with 136s (1) cores
% 0.14/0.47 % Starting new_bool_1 with 136s (1) cores
% 0.14/0.47 % SubtermCWHack with pid 3047136 completed with status 0
% 0.14/0.47 % Result found by SubtermCWHack
% 0.14/0.47 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/0.47 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.47 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/0.47 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.14/0.47 % No SInE strategy applied
% 0.14/0.47 % Search class: FGUNF-FFSF33-SFFFFFNN
% 0.14/0.47 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.14/0.47 % Starting SubtermCWHack with 136s (1) cores
% 0.14/0.47 % Preprocessing time : 0.002 s
% 0.14/0.47
% 0.14/0.47 % Proof found!
% 0.14/0.47 % SZS status Theorem
% 0.14/0.47 % SZS output start CNFRefutation
% See solution above
% 0.14/0.47 % Parsed axioms : 10
% 0.14/0.47 % Removed by relevancy pruning/SinE : 0
% 0.14/0.47 % Initial clauses : 12
% 0.14/0.47 % Removed in clause preprocessing : 0
% 0.14/0.47 % Initial clauses in saturation : 12
% 0.14/0.47 % Processed clauses : 30
% 0.14/0.47 % ...of these trivial : 0
% 0.14/0.47 % ...subsumed : 2
% 0.14/0.47 % ...remaining for further processing : 28
% 0.14/0.47 % Other redundant clauses eliminated : 0
% 0.14/0.47 % Clauses deleted for lack of memory : 0
% 0.14/0.47 % Backward-subsumed : 0
% 0.14/0.47 % Backward-rewritten : 1
% 0.14/0.47 % Generated clauses : 39
% 0.14/0.47 % ...of the previous two non-redundant : 27
% 0.14/0.47 % ...aggressively subsumed : 0
% 0.14/0.47 % Contextual simplify-reflections : 0
% 0.14/0.47 % Paramodulations : 39
% 0.14/0.47 % Factorizations : 0
% 0.14/0.47 % NegExts : 0
% 0.14/0.47 % Equation resolutions : 0
% 0.14/0.47 % Disequality decompositions : 0
% 0.14/0.47 % Total rewrite steps : 10
% 0.14/0.47 % ...of those cached : 4
% 0.14/0.47 % Propositional unsat checks : 0
% 0.14/0.47 % Propositional check models : 0
% 0.14/0.47 % Propositional check unsatisfiable : 0
% 0.14/0.47 % Propositional clauses : 0
% 0.14/0.47 % Propositional clauses after purity: 0
% 0.14/0.47 % Propositional unsat core size : 0
% 0.14/0.47 % Propositional preprocessing time : 0.000
% 0.14/0.47 % Propositional encoding time : 0.000
% 0.14/0.47 % Propositional solver time : 0.000
% 0.14/0.47 % Success case prop preproc time : 0.000
% 0.14/0.47 % Success case prop encoding time : 0.000
% 0.14/0.47 % Success case prop solver time : 0.000
% 0.14/0.47 % Current number of processed clauses : 27
% 0.14/0.47 % Positive orientable unit clauses : 5
% 0.14/0.47 % Positive unorientable unit clauses: 0
% 0.14/0.47 % Negative unit clauses : 2
% 0.14/0.47 % Non-unit-clauses : 20
% 0.14/0.47 % Current number of unprocessed clauses: 7
% 0.14/0.47 % ...number of literals in the above : 28
% 0.14/0.47 % Current number of archived formulas : 0
% 0.14/0.47 % Current number of archived clauses : 1
% 0.14/0.47 % Clause-clause subsumption calls (NU) : 45
% 0.14/0.47 % Rec. Clause-clause subsumption calls : 44
% 0.14/0.47 % Non-unit clause-clause subsumptions : 2
% 0.14/0.47 % Unit Clause-clause subsumption calls : 2
% 0.14/0.47 % Rewrite failures with RHS unbound : 0
% 0.14/0.47 % BW rewrite match attempts : 4
% 0.14/0.47 % BW rewrite match successes : 1
% 0.14/0.47 % Condensation attempts : 0
% 0.14/0.47 % Condensation successes : 0
% 0.14/0.47 % Termbank termtop insertions : 1155
% 0.14/0.47 % Search garbage collected termcells : 114
% 0.14/0.47
% 0.14/0.47 % -------------------------------------------------
% 0.14/0.47 % User time : 0.010 s
% 0.14/0.47 % System time : 0.003 s
% 0.14/0.47 % Total time : 0.013 s
% 0.14/0.47 % Maximum resident set size: 3636 pages
% 0.14/0.47
% 0.14/0.47 % -------------------------------------------------
% 0.14/0.47 % User time : 0.026 s
% 0.14/0.47 % System time : 0.011 s
% 0.14/0.47 % Total time : 0.037 s
% 0.14/0.47 % Maximum resident set size: 4608 pages
% 0.14/0.47 % E exiting
%------------------------------------------------------------------------------