%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : NUM627+3 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n014.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 01:55:45 PM UTC 2026
% Result : ContradictoryAxioms 97.07s 15.04s
% Output : CNFRefutation 97.07s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 7
% Syntax : Number of formulae : 24 ( 7 unt; 0 def)
% Number of atoms : 71 ( 6 equ)
% Maximal formula atoms : 9 ( 2 avg)
% Number of connectives : 79 ( 32 ~; 23 |; 16 &)
% ( 0 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 16 ( 16 usr; 11 con; 0-2 aty)
% Number of variables : 20 ( 0 sgn 15 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__5442,hypothesis,
~ ( aSubsetOf0(sdtlpdtrp0(xN,xm),sdtlpdtrp0(xN,szszuzczcdt0(xn)))
| ! [X1] :
( aElementOf0(X1,sdtlpdtrp0(xN,xm))
=> aElementOf0(X1,sdtlpdtrp0(xN,szszuzczcdt0(xn))) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__5442) ).
fof(m__3754,hypothesis,
! [X1,X2] :
( ( aElementOf0(X2,szNzAzT0)
& aElementOf0(X1,szNzAzT0) )
=> ( sdtlseqdt0(X2,X1)
=> ( aSubsetOf0(sdtlpdtrp0(xN,X1),sdtlpdtrp0(xN,X2))
& ! [X3] :
( aElementOf0(X3,sdtlpdtrp0(xN,X1))
=> aElementOf0(X3,sdtlpdtrp0(xN,X2)) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__3754) ).
fof(m__5461,hypothesis,
~ ( aSubsetOf0(sdtlpdtrp0(xN,xn),sdtlpdtrp0(xN,xm))
| ! [X1] :
( aElementOf0(X1,sdtlpdtrp0(xN,xn))
=> aElementOf0(X1,sdtlpdtrp0(xN,xm)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__5461) ).
fof(m__5389,hypothesis,
( xx = sdtlpdtrp0(xe,xm)
& aElementOf0(xm,szNzAzT0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__5389) ).
fof(mLessTotal,axiom,
! [X1,X2] :
( ( aElementOf0(X2,szNzAzT0)
& aElementOf0(X1,szNzAzT0) )
=> ( sdtlseqdt0(szszuzczcdt0(X2),X1)
| sdtlseqdt0(X1,X2) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mLessTotal) ).
fof(m__5309,hypothesis,
( sdtlpdtrp0(xe,xn) = xp
& aElementOf0(xn,szNzAzT0)
& aElementOf0(xn,sdtlbdtrb0(xd,szDzizrdt0(xd)))
& sdtlpdtrp0(xd,xn) = szDzizrdt0(xd)
& aElementOf0(xn,szDzozmdt0(xd)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__5309) ).
fof(mSuccNum,axiom,
! [X1] :
( aElementOf0(X1,szNzAzT0)
=> ( szszuzczcdt0(X1) != sz00
& aElementOf0(szszuzczcdt0(X1),szNzAzT0) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mSuccNum) ).
fof(c_0_7,hypothesis,
( ~ aSubsetOf0(sdtlpdtrp0(xN,xm),sdtlpdtrp0(xN,szszuzczcdt0(xn)))
& ~ aElementOf0(esk43_0,sdtlpdtrp0(xN,szszuzczcdt0(xn)))
& aElementOf0(esk43_0,sdtlpdtrp0(xN,xm)) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[m__5442])])])]) ).
fof(c_0_8,hypothesis,
! [X214,X215,X216] :
( ( ~ aElementOf0(X215,szNzAzT0)
| ~ aElementOf0(X214,szNzAzT0)
| ~ sdtlseqdt0(X215,X214)
| aSubsetOf0(sdtlpdtrp0(xN,X214),sdtlpdtrp0(xN,X215)) )
& ( ~ aElementOf0(X215,szNzAzT0)
| ~ aElementOf0(X214,szNzAzT0)
| ~ sdtlseqdt0(X215,X214)
| aElementOf0(X216,sdtlpdtrp0(xN,X215))
| ~ aElementOf0(X216,sdtlpdtrp0(xN,X214)) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[m__3754])])])])]) ).
fof(c_0_9,hypothesis,
( ~ aSubsetOf0(sdtlpdtrp0(xN,xn),sdtlpdtrp0(xN,xm))
& ~ aElementOf0(esk44_0,sdtlpdtrp0(xN,xm))
& aElementOf0(esk44_0,sdtlpdtrp0(xN,xn)) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[m__5461])])])]) ).
cnf(c_0_10,hypothesis,
~ aSubsetOf0(sdtlpdtrp0(xN,xm),sdtlpdtrp0(xN,szszuzczcdt0(xn))),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_11,hypothesis,
( ~ aElementOf0(X2,szNzAzT0)
| ~ aElementOf0(X1,szNzAzT0)
| ~ sdtlseqdt0(X2,X1)
| aSubsetOf0(sdtlpdtrp0(xN,X1),sdtlpdtrp0(xN,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_12,hypothesis,
aElementOf0(xm,szNzAzT0),
inference(split_conjunct,[status(thm)],[m__5389]) ).
fof(c_0_13,plain,
! [X78,X79] :
( sdtlseqdt0(szszuzczcdt0(X79),X78)
| sdtlseqdt0(X78,X79)
| ~ aElementOf0(X79,szNzAzT0)
| ~ aElementOf0(X78,szNzAzT0) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mLessTotal])])]) ).
cnf(c_0_14,hypothesis,
~ aSubsetOf0(sdtlpdtrp0(xN,xn),sdtlpdtrp0(xN,xm)),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_15,hypothesis,
aElementOf0(xn,szNzAzT0),
inference(split_conjunct,[status(thm)],[m__5309]) ).
fof(c_0_16,plain,
! [X1] :
( aElementOf0(X1,szNzAzT0)
=> ( szszuzczcdt0(X1) != sz00
& aElementOf0(szszuzczcdt0(X1),szNzAzT0) ) ),
inference(fof_simplification,[status(thm)],[mSuccNum]) ).
cnf(c_0_17,hypothesis,
( ~ aElementOf0(szszuzczcdt0(xn),szNzAzT0)
| ~ sdtlseqdt0(szszuzczcdt0(xn),xm) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_12])]) ).
cnf(c_0_18,plain,
( ~ aElementOf0(X2,szNzAzT0)
| ~ aElementOf0(X1,szNzAzT0)
| sdtlseqdt0(szszuzczcdt0(X2),X1)
| sdtlseqdt0(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_19,hypothesis,
~ sdtlseqdt0(xm,xn),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_11]),c_0_12]),c_0_15])]) ).
fof(c_0_20,plain,
! [X59] :
( ( ~ aElementOf0(X59,szNzAzT0)
| szszuzczcdt0(X59) != sz00 )
& ( ~ aElementOf0(X59,szNzAzT0)
| aElementOf0(szszuzczcdt0(X59),szNzAzT0) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_16])])])]) ).
cnf(c_0_21,hypothesis,
~ aElementOf0(szszuzczcdt0(xn),szNzAzT0),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_15]),c_0_12])]),c_0_19]) ).
cnf(c_0_22,plain,
( ~ aElementOf0(X1,szNzAzT0)
| aElementOf0(szszuzczcdt0(X1),szNzAzT0) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_23,hypothesis,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_15])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : NUM627+3 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.38 % Computer : n014.cluster.edu
% 0.10/0.38 % Model : x86_64 x86_64
% 0.10/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.38 % Memory : 8046.5625MB
% 0.10/0.38 % OS : Linux 6.8.0-71-generic
% 0.10/0.38 % CPULimit : 300
% 0.10/0.38 % WCLimit : 300
% 0.10/0.38 % DateTime : Mon Sep 21 02:45:35 UTC 2026
% 0.10/0.38 % CPUTime :
% 0.10/0.38 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.45 Running first-order theorem proving
% 0.10/0.45 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
% 97.07/15.04 % Version: 3.5.1
% 97.07/15.04 % Preprocessing class: FSLSSMSMSSSNFFN.
% 97.07/15.04 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 97.07/15.04 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 97.07/15.04 % Starting new_bool_3 with 300s (1) cores
% 97.07/15.04 % Starting new_bool_1 with 300s (1) cores
% 97.07/15.04 % Starting sh5l with 300s (1) cores
% 97.07/15.04 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 2982745 completed with status 0
% 97.07/15.04 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 97.07/15.04 % Preprocessing class: FSLSSMSMSSSNFFN.
% 97.07/15.04 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 97.07/15.04 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 97.07/15.04 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 97.07/15.04 % No SInE strategy applied
% 97.07/15.04 % Search class: FGHSF-SMLM32-MFFFFFNN
% 97.07/15.04 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 97.07/15.04 % Starting SubtermCWHack with 136s (1) cores
% 97.07/15.04 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 97.07/15.04 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S059I with 136s (1) cores
% 97.07/15.04 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 136s (1) cores
% 97.07/15.04 % Starting new_bool_3 with 136s (1) cores
% 97.07/15.04 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 2982751 completed with status 0
% 97.07/15.04 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 97.07/15.04 % Preprocessing class: FSLSSMSMSSSNFFN.
% 97.07/15.04 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 97.07/15.04 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 97.07/15.04 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 97.07/15.04 % No SInE strategy applied
% 97.07/15.04 % Search class: FGHSF-SMLM32-MFFFFFNN
% 97.07/15.04 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 97.07/15.04 % Starting SubtermCWHack with 136s (1) cores
% 97.07/15.04 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 97.07/15.04 % Preprocessing time : 0.296 s
% 97.07/15.04 % Presaturation interreduction done
% 97.07/15.04
% 97.07/15.04 % Proof found!
% 97.07/15.04 % SZS status ContradictoryAxioms
% 97.07/15.04 % SZS output start CNFRefutation
% See solution above
% 97.07/15.04 % Parsed axioms : 119
% 97.07/15.04 % Removed by relevancy pruning/SinE : 0
% 97.07/15.04 % Initial clauses : 4933
% 97.07/15.04 % Removed in clause preprocessing : 7
% 97.07/15.04 % Initial clauses in saturation : 4926
% 97.07/15.04 % Processed clauses : 7154
% 97.07/15.04 % ...of these trivial : 16
% 97.07/15.04 % ...subsumed : 920
% 97.07/15.04 % ...remaining for further processing : 6218
% 97.07/15.04 % Other redundant clauses eliminated : 2047
% 97.07/15.04 % Clauses deleted for lack of memory : 0
% 97.07/15.04 % Backward-subsumed : 21
% 97.07/15.04 % Backward-rewritten : 5
% 97.07/15.04 % Generated clauses : 2811
% 97.07/15.04 % ...of the previous two non-redundant : 2667
% 97.07/15.04 % ...aggressively subsumed : 0
% 97.07/15.04 % Contextual simplify-reflections : 70
% 97.07/15.04 % Paramodulations : 962
% 97.07/15.04 % Factorizations : 0
% 97.07/15.04 % NegExts : 0
% 97.07/15.04 % Equation resolutions : 2049
% 97.07/15.04 % Disequality decompositions : 0
% 97.07/15.04 % Total rewrite steps : 724
% 97.07/15.04 % ...of those cached : 635
% 97.07/15.04 % Propositional unsat checks : 2
% 97.07/15.04 % Propositional check models : 2
% 97.07/15.04 % Propositional check unsatisfiable : 0
% 97.07/15.04 % Propositional clauses : 0
% 97.07/15.04 % Propositional clauses after purity: 0
% 97.07/15.04 % Propositional unsat core size : 0
% 97.07/15.04 % Propositional preprocessing time : 0.000
% 97.07/15.04 % Propositional encoding time : 0.072
% 97.07/15.04 % Propositional solver time : 0.003
% 97.07/15.04 % Success case prop preproc time : 0.000
% 97.07/15.04 % Success case prop encoding time : 0.000
% 97.07/15.04 % Success case prop solver time : 0.000
% 97.07/15.04 % Current number of processed clauses : 333
% 97.07/15.04 % Positive orientable unit clauses : 121
% 97.07/15.04 % Positive unorientable unit clauses: 0
% 97.07/15.04 % Negative unit clauses : 25
% 97.07/15.04 % Non-unit-clauses : 187
% 97.07/15.04 % Current number of unprocessed clauses: 4452
% 97.07/15.04 % ...number of literals in the above : 46373
% 97.07/15.04 % Current number of archived formulas : 0
% 97.07/15.04 % Current number of archived clauses : 4042
% 97.07/15.04 % Clause-clause subsumption calls (NU) : 8175084
% 97.07/15.04 % Rec. Clause-clause subsumption calls : 82902
% 97.07/15.04 % Non-unit clause-clause subsumptions : 991
% 97.07/15.04 % Unit Clause-clause subsumption calls : 1488
% 97.07/15.04 % Rewrite failures with RHS unbound : 0
% 97.07/15.04 % BW rewrite match attempts : 5
% 97.07/15.04 % BW rewrite match successes : 5
% 97.07/15.04 % Condensation attempts : 0
% 97.07/15.04 % Condensation successes : 0
% 97.07/15.04 % Termbank termtop insertions : 873032
% 97.07/15.04 % Search garbage collected termcells : 32098
% 97.07/15.04
% 97.07/15.04 % -------------------------------------------------
% 97.07/15.04 % User time : 14.337 s
% 97.07/15.04 % System time : 0.091 s
% 97.07/15.04 % Total time : 14.428 s
% 97.07/15.04 % Maximum resident set size: 16120 pages
% 97.07/15.04
% 97.07/15.04 % -------------------------------------------------
% 97.07/15.04 % User time : 67.886 s
% 97.07/15.04 % System time : 0.420 s
% 97.07/15.04 % Total time : 68.306 s
% 97.07/15.04 % Maximum resident set size: 5120 pages
% 97.07/15.04 % E exiting
%------------------------------------------------------------------------------