%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SEU420+3 : 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 : n013.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:05 PM UTC 2026
% Result : Theorem 13.99s 3.47s
% Output : CNFRefutation 13.99s
% 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,
! [X122,X123,X124] :
( r1_tarski(X122,k3_xboole_0(X123,X124))
| ~ r1_tarski(X122,X124)
| ~ r1_tarski(X122,X123) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t19_xboole_1])])]) ).
fof(c_0_9,plain,
! [X332,X333,X334] :
( r1_tarski(k9_relat_1(X333,X332),k9_relat_1(X334,X332))
| ~ r1_tarski(X333,X334)
| ~ v1_relat_1(X334)
| ~ v1_relat_1(X333) ),
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,
! [X51,X52] :
( v1_relat_1(X51)
| ~ r1_tarski(X51,X52)
| ~ v1_relat_1(X52) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t3_relat_1])])]) ).
fof(c_0_11,plain,
! [X117,X118] : r1_tarski(k3_xboole_0(X117,X118),X117),
inference(variable_rename,[status(thm)],[t17_xboole_1]) ).
fof(c_0_12,plain,
! [X110,X111] : k3_xboole_0(X110,X111) = k3_xboole_0(X111,X110),
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.02 % Problem : SEU420+3 : TPTP v9.3.1. Released v3.4.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.12/0.36 % Computer : n013.cluster.edu
% 0.12/0.36 % Model : x86_64 x86_64
% 0.12/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.36 % Memory : 8046.5625MB
% 0.12/0.36 % OS : Linux 6.8.0-71-generic
% 0.12/0.37 % CPULimit : 300
% 0.12/0.37 % WCLimit : 300
% 0.12/0.37 % DateTime : Mon Sep 21 06:24:54 UTC 2026
% 0.12/0.37 % CPUTime :
% 0.12/0.37 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.12/0.41 Running first-order theorem proving
% 0.12/0.41 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
% 13.99/3.47 % Version: 3.5.1
% 13.99/3.47 % Preprocessing class: FMLLMMLLSSSNFFN.
% 13.99/3.47 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 13.99/3.47 % Starting new_bool_3 with 900s (3) cores
% 13.99/3.47 % Starting new_bool_1 with 900s (3) cores
% 13.99/3.47 % Starting sh5l with 300s (1) cores
% 13.99/3.47 % Starting G-E--_211_C18_F1_AE_CS_SP_S0Y with 300s (1) cores
% 13.99/3.47 % new_bool_1 with pid 130747 completed with status 0
% 13.99/3.47 % Result found by new_bool_1
% 13.99/3.47 % Preprocessing class: FMLLMMLLSSSNFFN.
% 13.99/3.47 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 13.99/3.47 % Starting new_bool_3 with 900s (3) cores
% 13.99/3.47 % Starting new_bool_1 with 900s (3) cores
% 13.99/3.47 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 13.99/3.47 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 13.99/3.47 % Search class: FGHSM-SMLM32-MFFFFFNN
% 13.99/3.47 % Scheduled 13 strats onto 3 cores with 900 seconds (900 total)
% 13.99/3.47 % Starting SubtermCWHack with 82s (1) cores
% 13.99/3.47 % Starting new_bool_1 with 91s (1) cores
% 13.99/3.47 % Starting C12_02_nc_SAT001_MinMin_p005000_rr with 68s (1) cores
% 13.99/3.47 % C12_02_nc_SAT001_MinMin_p005000_rr with pid 130950 completed with status 0
% 13.99/3.47 % Result found by C12_02_nc_SAT001_MinMin_p005000_rr
% 13.99/3.47 % Preprocessing class: FMLLMMLLSSSNFFN.
% 13.99/3.47 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 13.99/3.47 % Starting new_bool_3 with 900s (3) cores
% 13.99/3.47 % Starting new_bool_1 with 900s (3) cores
% 13.99/3.47 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 13.99/3.47 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 13.99/3.47 % Search class: FGHSM-SMLM32-MFFFFFNN
% 13.99/3.47 % Scheduled 13 strats onto 3 cores with 900 seconds (900 total)
% 13.99/3.47 % Starting SubtermCWHack with 82s (1) cores
% 13.99/3.47 % Starting new_bool_1 with 91s (1) cores
% 13.99/3.47 % Starting C12_02_nc_SAT001_MinMin_p005000_rr with 68s (1) cores
% 13.99/3.47 % Preprocessing time : 0.079 s
% 13.99/3.47 % Presaturation interreduction done
% 13.99/3.47
% 13.99/3.47 % Proof found!
% 13.99/3.47 % SZS status Theorem
% 13.99/3.47 % SZS output start CNFRefutation
% See solution above
% 13.99/3.47 % Parsed axioms : 19081
% 13.99/3.47 % Removed by relevancy pruning/SinE : 17745
% 13.99/3.47 % Initial clauses : 2612
% 13.99/3.47 % Removed in clause preprocessing : 48
% 13.99/3.47 % Initial clauses in saturation : 2564
% 13.99/3.47 % Processed clauses : 8626
% 13.99/3.47 % ...of these trivial : 88
% 13.99/3.47 % ...subsumed : 4164
% 13.99/3.47 % ...remaining for further processing : 4374
% 13.99/3.47 % Other redundant clauses eliminated : 379
% 13.99/3.47 % Clauses deleted for lack of memory : 0
% 13.99/3.47 % Backward-subsumed : 60
% 13.99/3.47 % Backward-rewritten : 67
% 13.99/3.47 % Generated clauses : 18829
% 13.99/3.47 % ...of the previous two non-redundant : 15459
% 13.99/3.47 % ...aggressively subsumed : 0
% 13.99/3.47 % Contextual simplify-reflections : 166
% 13.99/3.47 % Paramodulations : 18460
% 13.99/3.47 % Factorizations : 0
% 13.99/3.47 % NegExts : 0
% 13.99/3.47 % Equation resolutions : 384
% 13.99/3.47 % Disequality decompositions : 0
% 13.99/3.47 % Total rewrite steps : 9534
% 13.99/3.47 % ...of those cached : 8343
% 13.99/3.47 % Propositional unsat checks : 0
% 13.99/3.47 % Propositional check models : 0
% 13.99/3.47 % Propositional check unsatisfiable : 0
% 13.99/3.47 % Propositional clauses : 0
% 13.99/3.47 % Propositional clauses after purity: 0
% 13.99/3.47 % Propositional unsat core size : 0
% 13.99/3.47 % Propositional preprocessing time : 0.000
% 13.99/3.47 % Propositional encoding time : 0.000
% 13.99/3.47 % Propositional solver time : 0.000
% 13.99/3.47 % Success case prop preproc time : 0.000
% 13.99/3.47 % Success case prop encoding time : 0.000
% 13.99/3.47 % Success case prop solver time : 0.000
% 13.99/3.47 % Current number of processed clauses : 1675
% 13.99/3.47 % Positive orientable unit clauses : 425
% 13.99/3.47 % Positive unorientable unit clauses: 3
% 13.99/3.47 % Negative unit clauses : 351
% 13.99/3.47 % Non-unit-clauses : 896
% 13.99/3.47 % Current number of unprocessed clauses: 11620
% 13.99/3.47 % ...number of literals in the above : 30306
% 13.99/3.47 % Current number of archived formulas : 0
% 13.99/3.47 % Current number of archived clauses : 2446
% 13.99/3.47 % Clause-clause subsumption calls (NU) : 3168819
% 13.99/3.47 % Rec. Clause-clause subsumption calls : 543677
% 13.99/3.47 % Non-unit clause-clause subsumptions : 1783
% 13.99/3.47 % Unit Clause-clause subsumption calls : 47177
% 13.99/3.47 % Rewrite failures with RHS unbound : 0
% 13.99/3.47 % BW rewrite match attempts : 348
% 13.99/3.47 % BW rewrite match successes : 236
% 13.99/3.47 % Condensation attempts : 0
% 13.99/3.47 % Condensation successes : 0
% 13.99/3.47 % Termbank termtop insertions : 953747
% 13.99/3.47 % Search garbage collected termcells : 217910
% 13.99/3.47
% 13.99/3.47 % -------------------------------------------------
% 13.99/3.47 % User time : 1.899 s
% 13.99/3.47 % System time : 0.108 s
% 13.99/3.47 % Total time : 2.007 s
% 13.99/3.47 % Maximum resident set size: 42344 pages
% 13.99/3.47
% 13.99/3.47 % -------------------------------------------------
% 13.99/3.47 % User time : 5.979 s
% 13.99/3.47 % System time : 0.323 s
% 13.99/3.47 % Total time : 6.302 s
% 13.99/3.47 % Maximum resident set size: 32768 pages
% 13.99/3.47 % E exiting
%------------------------------------------------------------------------------