%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SEU420+2 : TPTP v9.3.1. Released v3.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n020.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 02:25:04 PM UTC 2026
% Result : Theorem 0.26s 3.16s
% Output : CNFRefutation 0.26s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 6
% Syntax : Number of formulae : 26 ( 12 unt; 0 def)
% Number of atoms : 56 ( 3 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 52 ( 22 ~; 17 |; 3 &)
% ( 0 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 47 ( 2 sgn 30 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t13_relset_2,conjecture,
! [X1,X2] :
( v1_relat_1(X2)
=> ! [X3] :
( v1_relat_1(X3)
=> r1_tarski(k9_relat_1(k3_xboole_0(X2,X3),k3_pua2mss1(X1)),k3_xboole_0(k9_relat_1(X2,k3_pua2mss1(X1)),k9_relat_1(X3,k3_pua2mss1(X1)))) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t13_relset_2) ).
fof(t19_xboole_1,axiom,
! [X1,X2,X3] :
( ( r1_tarski(X1,X3)
& r1_tarski(X1,X2) )
=> r1_tarski(X1,k3_xboole_0(X2,X3)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET007/SET007+4.ax',t19_xboole_1) ).
fof(t157_relat_1,axiom,
! [X1,X2] :
( v1_relat_1(X2)
=> ! [X3] :
( v1_relat_1(X3)
=> ( r1_tarski(X2,X3)
=> r1_tarski(k9_relat_1(X2,X1),k9_relat_1(X3,X1)) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET007/SET007+10.ax',t157_relat_1) ).
fof(t3_relat_1,axiom,
! [X1,X2] :
( v1_relat_1(X2)
=> ( r1_tarski(X1,X2)
=> v1_relat_1(X1) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET007/SET007+10.ax',t3_relat_1) ).
fof(t17_xboole_1,axiom,
! [X1,X2] : r1_tarski(k3_xboole_0(X1,X2),X1),
file('/export/starexec/sandbox2/benchmark/Axioms/SET007/SET007+4.ax',t17_xboole_1) ).
fof(commutativity_k3_xboole_0,axiom,
! [X1,X2] : k3_xboole_0(X1,X2) = k3_xboole_0(X2,X1),
file('/export/starexec/sandbox2/benchmark/Axioms/SET007/SET007+2.ax',commutativity_k3_xboole_0) ).
fof(c_0_6,negated_conjecture,
~ ! [X1,X2] :
( v1_relat_1(X2)
=> ! [X3] :
( v1_relat_1(X3)
=> r1_tarski(k9_relat_1(k3_xboole_0(X2,X3),k3_pua2mss1(X1)),k3_xboole_0(k9_relat_1(X2,k3_pua2mss1(X1)),k9_relat_1(X3,k3_pua2mss1(X1)))) ) ),
inference(assume_negation,[status(cth)],[t13_relset_2]) ).
fof(c_0_7,negated_conjecture,
( ~ r1_tarski(k9_relat_1(k3_xboole_0(esk2_0,esk3_0),k3_pua2mss1(esk1_0)),k3_xboole_0(k9_relat_1(esk2_0,k3_pua2mss1(esk1_0)),k9_relat_1(esk3_0,k3_pua2mss1(esk1_0))))
& v1_relat_1(esk3_0)
& v1_relat_1(esk2_0) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])])]) ).
fof(c_0_8,plain,
! [X90,X91,X92] :
( r1_tarski(X90,k3_xboole_0(X91,X92))
| ~ r1_tarski(X90,X92)
| ~ r1_tarski(X90,X91) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t19_xboole_1])])]) ).
fof(c_0_9,plain,
! [X258,X259,X260] :
( r1_tarski(k9_relat_1(X259,X258),k9_relat_1(X260,X258))
| ~ r1_tarski(X259,X260)
| ~ v1_relat_1(X260)
| ~ v1_relat_1(X259) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t157_relat_1])])])]) ).
fof(c_0_10,plain,
! [X31,X32] :
( v1_relat_1(X31)
| ~ r1_tarski(X31,X32)
| ~ v1_relat_1(X32) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t3_relat_1])])]) ).
fof(c_0_11,plain,
! [X85,X86] : r1_tarski(k3_xboole_0(X85,X86),X85),
inference(variable_rename,[status(thm)],[t17_xboole_1]) ).
fof(c_0_12,plain,
! [X78,X79] : k3_xboole_0(X78,X79) = k3_xboole_0(X79,X78),
inference(variable_rename,[status(thm)],[commutativity_k3_xboole_0]) ).
cnf(c_0_13,negated_conjecture,
~ r1_tarski(k9_relat_1(k3_xboole_0(esk2_0,esk3_0),k3_pua2mss1(esk1_0)),k3_xboole_0(k9_relat_1(esk2_0,k3_pua2mss1(esk1_0)),k9_relat_1(esk3_0,k3_pua2mss1(esk1_0)))),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_14,plain,
( ~ r1_tarski(X1,X3)
| ~ r1_tarski(X1,X2)
| r1_tarski(X1,k3_xboole_0(X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_15,plain,
( ~ r1_tarski(X1,X2)
| ~ v1_relat_1(X2)
| ~ v1_relat_1(X1)
| r1_tarski(k9_relat_1(X1,X3),k9_relat_1(X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_16,plain,
( ~ r1_tarski(X2,X1)
| ~ v1_relat_1(X1)
| v1_relat_1(X2) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_17,plain,
r1_tarski(k3_xboole_0(X1,X2),X1),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_18,plain,
k3_xboole_0(X1,X2) = k3_xboole_0(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_19,negated_conjecture,
( ~ r1_tarski(k9_relat_1(k3_xboole_0(esk2_0,esk3_0),k3_pua2mss1(esk1_0)),k9_relat_1(esk2_0,k3_pua2mss1(esk1_0)))
| ~ r1_tarski(k9_relat_1(k3_xboole_0(esk2_0,esk3_0),k3_pua2mss1(esk1_0)),k9_relat_1(esk3_0,k3_pua2mss1(esk1_0))) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_20,plain,
( ~ r1_tarski(X1,X3)
| ~ v1_relat_1(X3)
| r1_tarski(k9_relat_1(X1,X2),k9_relat_1(X3,X2)) ),
inference(csr,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_21,negated_conjecture,
v1_relat_1(esk3_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_22,plain,
r1_tarski(k3_xboole_0(X1,X2),X2),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_23,negated_conjecture,
~ r1_tarski(k9_relat_1(k3_xboole_0(esk2_0,esk3_0),k3_pua2mss1(esk1_0)),k9_relat_1(esk2_0,k3_pua2mss1(esk1_0))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21]),c_0_22])]) ).
cnf(c_0_24,negated_conjecture,
v1_relat_1(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_25,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_20]),c_0_24]),c_0_17])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : SEU420+2 : TPTP v9.3.1. Released v3.4.0.
% 0.00/0.06 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.17/0.44 % Computer : n020.cluster.edu
% 0.17/0.44 % Model : x86_64 x86_64
% 0.17/0.44 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.44 % Memory : 8046.5625MB
% 0.17/0.44 % OS : Linux 6.8.0-71-generic
% 0.17/0.45 % CPULimit : 300
% 0.17/0.45 % WCLimit : 300
% 0.17/0.45 % DateTime : Mon Sep 21 06:26:17 UTC 2026
% 0.17/0.45 % CPUTime :
% 0.17/0.45 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.17/0.50 Running first-order theorem proving
% 0.17/0.50 Running: /export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p
% 0.26/3.16 % Version: 3.5.1
% 0.26/3.16 % Preprocessing class: FMLMSMLLSSSNFFN.
% 0.26/3.16 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.26/3.16 % Starting new_bool_3 with 900s (3) cores
% 0.26/3.16 % Starting new_bool_1 with 900s (3) cores
% 0.26/3.16 % Starting sh5l with 300s (1) cores
% 0.26/3.16 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2p with 300s (1) cores
% 0.26/3.16 % new_bool_3 with pid 2216447 completed with status 0
% 0.26/3.16 % Result found by new_bool_3
% 0.26/3.16 % Preprocessing class: FMLMSMLLSSSNFFN.
% 0.26/3.16 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.26/3.16 % Starting new_bool_3 with 900s (3) cores
% 0.26/3.16 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.26/3.16 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.26/3.16 % Search class: FGHSM-SMLM32-MFFFFFNN
% 0.26/3.16 % Scheduled 13 strats onto 3 cores with 900 seconds (900 total)
% 0.26/3.16 % Starting SubtermCWHack with 82s (1) cores
% 0.26/3.16 % Starting new_bool_3 with 91s (1) cores
% 0.26/3.16 % Starting C12_02_nc_SAT001_MinMin_p005000_rr with 68s (1) cores
% 0.26/3.16 % C12_02_nc_SAT001_MinMin_p005000_rr with pid 2216454 completed with status 0
% 0.26/3.16 % Result found by C12_02_nc_SAT001_MinMin_p005000_rr
% 0.26/3.16 % Preprocessing class: FMLMSMLLSSSNFFN.
% 0.26/3.16 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.26/3.16 % Starting new_bool_3 with 900s (3) cores
% 0.26/3.16 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.26/3.16 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.26/3.16 % Search class: FGHSM-SMLM32-MFFFFFNN
% 0.26/3.16 % Scheduled 13 strats onto 3 cores with 900 seconds (900 total)
% 0.26/3.16 % Starting SubtermCWHack with 82s (1) cores
% 0.26/3.16 % Starting new_bool_3 with 91s (1) cores
% 0.26/3.16 % Starting C12_02_nc_SAT001_MinMin_p005000_rr with 68s (1) cores
% 0.26/3.16 % Preprocessing time : 0.055 s
% 0.26/3.16 % Presaturation interreduction done
% 0.26/3.16
% 0.26/3.16 % Proof found!
% 0.26/3.16 % SZS status Theorem
% 0.26/3.16 % SZS output start CNFRefutation
% See solution above
% 0.26/3.16 % Parsed axioms : 4482
% 0.26/3.16 % Removed by relevancy pruning/SinE : 3456
% 0.26/3.16 % Initial clauses : 1867
% 0.26/3.16 % Removed in clause preprocessing : 44
% 0.26/3.16 % Initial clauses in saturation : 1823
% 0.26/3.16 % Processed clauses : 6580
% 0.26/3.16 % ...of these trivial : 54
% 0.26/3.16 % ...subsumed : 3254
% 0.26/3.16 % ...remaining for further processing : 3272
% 0.26/3.16 % Other redundant clauses eliminated : 315
% 0.26/3.16 % Clauses deleted for lack of memory : 0
% 0.26/3.16 % Backward-subsumed : 43
% 0.26/3.16 % Backward-rewritten : 45
% 0.26/3.16 % Generated clauses : 16247
% 0.26/3.16 % ...of the previous two non-redundant : 13291
% 0.26/3.16 % ...aggressively subsumed : 0
% 0.26/3.16 % Contextual simplify-reflections : 76
% 0.26/3.16 % Paramodulations : 15939
% 0.26/3.16 % Factorizations : 0
% 0.26/3.16 % NegExts : 0
% 0.26/3.16 % Equation resolutions : 319
% 0.26/3.16 % Disequality decompositions : 0
% 0.26/3.16 % Total rewrite steps : 8204
% 0.26/3.16 % ...of those cached : 7173
% 0.26/3.16 % Propositional unsat checks : 0
% 0.26/3.16 % Propositional check models : 0
% 0.26/3.16 % Propositional check unsatisfiable : 0
% 0.26/3.16 % Propositional clauses : 0
% 0.26/3.16 % Propositional clauses after purity: 0
% 0.26/3.16 % Propositional unsat core size : 0
% 0.26/3.16 % Propositional preprocessing time : 0.000
% 0.26/3.16 % Propositional encoding time : 0.000
% 0.26/3.16 % Propositional solver time : 0.000
% 0.26/3.16 % Success case prop preproc time : 0.000
% 0.26/3.16 % Success case prop encoding time : 0.000
% 0.26/3.16 % Success case prop solver time : 0.000
% 0.26/3.16 % Current number of processed clauses : 1295
% 0.26/3.16 % Positive orientable unit clauses : 295
% 0.26/3.16 % Positive unorientable unit clauses: 3
% 0.26/3.16 % Negative unit clauses : 254
% 0.26/3.16 % Non-unit-clauses : 743
% 0.26/3.16 % Current number of unprocessed clauses: 10105
% 0.26/3.16 % ...number of literals in the above : 25161
% 0.26/3.16 % Current number of archived formulas : 0
% 0.26/3.16 % Current number of archived clauses : 1760
% 0.26/3.16 % Clause-clause subsumption calls (NU) : 1025427
% 0.26/3.16 % Rec. Clause-clause subsumption calls : 275720
% 0.26/3.16 % Non-unit clause-clause subsumptions : 1347
% 0.26/3.16 % Unit Clause-clause subsumption calls : 24662
% 0.26/3.16 % Rewrite failures with RHS unbound : 0
% 0.26/3.16 % BW rewrite match attempts : 296
% 0.26/3.16 % BW rewrite match successes : 203
% 0.26/3.16 % Condensation attempts : 0
% 0.26/3.16 % Condensation successes : 0
% 0.26/3.16 % Termbank termtop insertions : 385886
% 0.26/3.16 % Search garbage collected termcells : 58934
% 0.26/3.16
% 0.26/3.16 % -------------------------------------------------
% 0.26/3.16 % User time : 1.511 s
% 0.26/3.16 % System time : 0.062 s
% 0.26/3.16 % Total time : 1.574 s
% 0.26/3.16 % Maximum resident set size: 15284 pages
% 0.26/3.16
% 0.26/3.16 % -------------------------------------------------
% 0.26/3.16 % User time : 4.798 s
% 0.26/3.16 % System time : 0.209 s
% 0.26/3.16 % Total time : 5.007 s
% 0.26/3.16 % Maximum resident set size: 10240 pages
% 0.26/3.16 % E exiting
%------------------------------------------------------------------------------