%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : NUM533+1 : 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 : n010.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:49:27 PM UTC 2026
% Result : Theorem 0.22s 0.54s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 3
% Syntax : Number of formulae : 20 ( 7 unt; 0 def)
% Number of atoms : 61 ( 0 equ)
% Maximal formula atoms : 15 ( 3 avg)
% Number of connectives : 67 ( 26 ~; 26 |; 10 &)
% ( 1 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 18 ( 0 sgn 7 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__,conjecture,
( ( aSubsetOf0(xB,xC)
& aSubsetOf0(xA,xB) )
=> aSubsetOf0(xA,xC) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).
fof(mDefSub,axiom,
! [X1] :
( aSet0(X1)
=> ! [X2] :
( aSubsetOf0(X2,X1)
<=> ( ! [X3] :
( aElementOf0(X3,X2)
=> aElementOf0(X3,X1) )
& aSet0(X2) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mDefSub) ).
fof(m__522,hypothesis,
( aSet0(xC)
& aSet0(xB)
& aSet0(xA) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__522) ).
fof(c_0_3,negated_conjecture,
~ ( ( aSubsetOf0(xB,xC)
& aSubsetOf0(xA,xB) )
=> aSubsetOf0(xA,xC) ),
inference(assume_negation,[status(cth)],[m__]) ).
fof(c_0_4,plain,
! [X4,X5,X6,X7] :
( ( ~ aSet0(X4)
| aSubsetOf0(X7,X4)
| ~ aSet0(X7)
| ~ aElementOf0(esk1_2(X4,X7),X4) )
& ( ~ aSet0(X4)
| aSubsetOf0(X7,X4)
| ~ aSet0(X7)
| aElementOf0(esk1_2(X4,X7),X7) )
& ( ~ aSet0(X4)
| ~ aSubsetOf0(X5,X4)
| aElementOf0(X6,X4)
| ~ aElementOf0(X6,X5) )
& ( ~ aSet0(X4)
| ~ aSubsetOf0(X5,X4)
| aSet0(X5) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[mDefSub])])])])])])]) ).
fof(c_0_5,negated_conjecture,
( ~ aSubsetOf0(xA,xC)
& aSubsetOf0(xB,xC)
& aSubsetOf0(xA,xB) ),
inference(fof_nnf,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])]) ).
cnf(c_0_6,plain,
( ~ aSet0(X3)
| ~ aSubsetOf0(X2,X3)
| ~ aElementOf0(X1,X2)
| aElementOf0(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,negated_conjecture,
aSubsetOf0(xB,xC),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_8,hypothesis,
aSet0(xC),
inference(split_conjunct,[status(thm)],[m__522]) ).
cnf(c_0_9,negated_conjecture,
aSubsetOf0(xA,xB),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_10,hypothesis,
aSet0(xB),
inference(split_conjunct,[status(thm)],[m__522]) ).
cnf(c_0_11,plain,
( ~ aSet0(X1)
| ~ aSet0(X2)
| ~ aElementOf0(esk1_2(X1,X2),X1)
| aSubsetOf0(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_12,negated_conjecture,
( ~ aElementOf0(X1,xB)
| aElementOf0(X1,xC) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_7]),c_0_8])]) ).
cnf(c_0_13,negated_conjecture,
( ~ aElementOf0(X1,xA)
| aElementOf0(X1,xB) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_9]),c_0_10])]) ).
cnf(c_0_14,plain,
( ~ aSet0(X1)
| ~ aSet0(X2)
| aSubsetOf0(X2,X1)
| aElementOf0(esk1_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_15,hypothesis,
aSet0(xA),
inference(split_conjunct,[status(thm)],[m__522]) ).
cnf(c_0_16,negated_conjecture,
( ~ aSet0(X1)
| ~ aElementOf0(esk1_2(xC,X1),xB)
| aSubsetOf0(X1,xC) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_8])]) ).
cnf(c_0_17,negated_conjecture,
( ~ aSet0(X1)
| aElementOf0(esk1_2(X1,xA),xB)
| aSubsetOf0(xA,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_15])]) ).
cnf(c_0_18,negated_conjecture,
~ aSubsetOf0(xA,xC),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_19,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_15]),c_0_8])]),c_0_18]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : NUM533+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.07 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.18/0.45 % Computer : n010.cluster.edu
% 0.18/0.45 % Model : x86_64 x86_64
% 0.18/0.45 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.45 % Memory : 8046.5625MB
% 0.18/0.45 % OS : Linux 6.8.0-71-generic
% 0.18/0.45 % CPULimit : 300
% 0.18/0.45 % WCLimit : 300
% 0.18/0.45 % DateTime : Mon Sep 21 02:38:39 UTC 2026
% 0.18/0.46 % CPUTime :
% 0.18/0.46 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.18/0.50 Running first-order theorem proving
% 0.18/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.22/0.54 % Version: 3.5.1
% 0.22/0.54 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.22/0.54 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.54 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.22/0.54 % Starting new_bool_3 with 300s (1) cores
% 0.22/0.54 % Starting new_bool_1 with 300s (1) cores
% 0.22/0.54 % Starting sh5l with 300s (1) cores
% 0.22/0.54 % sh5l with pid 4056516 completed with status 0
% 0.22/0.54 % Result found by sh5l
% 0.22/0.54 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.22/0.54 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.54 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.22/0.54 % Starting new_bool_3 with 300s (1) cores
% 0.22/0.54 % Starting new_bool_1 with 300s (1) cores
% 0.22/0.54 % Starting sh5l with 300s (1) cores
% 0.22/0.54 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.22/0.54 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.22/0.54 % Search class: FGHSF-FFSM21-SFFFFFNN
% 0.22/0.54 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.22/0.54 % Starting SubtermCWHack with 31s (1) cores
% 0.22/0.54 % SubtermCWHack with pid 4056521 completed with status 0
% 0.22/0.54 % Result found by SubtermCWHack
% 0.22/0.54 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.22/0.54 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.54 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.22/0.54 % Starting new_bool_3 with 300s (1) cores
% 0.22/0.54 % Starting new_bool_1 with 300s (1) cores
% 0.22/0.54 % Starting sh5l with 300s (1) cores
% 0.22/0.54 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.22/0.54 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.22/0.54 % Search class: FGHSF-FFSM21-SFFFFFNN
% 0.22/0.54 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.22/0.54 % Starting SubtermCWHack with 31s (1) cores
% 0.22/0.54 % Preprocessing time : 0.002 s
% 0.22/0.54
% 0.22/0.54 % Proof found!
% 0.22/0.54 % SZS status Theorem
% 0.22/0.54 % SZS output start CNFRefutation
% See solution above
% 0.22/0.54 % Parsed axioms : 15
% 0.22/0.54 % Removed by relevancy pruning/SinE : 0
% 0.22/0.54 % Initial clauses : 24
% 0.22/0.54 % Removed in clause preprocessing : 4
% 0.22/0.54 % Initial clauses in saturation : 20
% 0.22/0.54 % Processed clauses : 40
% 0.22/0.54 % ...of these trivial : 0
% 0.22/0.54 % ...subsumed : 2
% 0.22/0.54 % ...remaining for further processing : 38
% 0.22/0.54 % Other redundant clauses eliminated : 3
% 0.22/0.54 % Clauses deleted for lack of memory : 0
% 0.22/0.54 % Backward-subsumed : 0
% 0.22/0.54 % Backward-rewritten : 0
% 0.22/0.54 % Generated clauses : 31
% 0.22/0.54 % ...of the previous two non-redundant : 21
% 0.22/0.54 % ...aggressively subsumed : 0
% 0.22/0.54 % Contextual simplify-reflections : 1
% 0.22/0.54 % Paramodulations : 28
% 0.22/0.54 % Factorizations : 0
% 0.22/0.54 % NegExts : 0
% 0.22/0.54 % Equation resolutions : 3
% 0.22/0.54 % Disequality decompositions : 0
% 0.22/0.54 % Total rewrite steps : 29
% 0.22/0.54 % ...of those cached : 22
% 0.22/0.54 % Propositional unsat checks : 0
% 0.22/0.54 % Propositional check models : 0
% 0.22/0.54 % Propositional check unsatisfiable : 0
% 0.22/0.54 % Propositional clauses : 0
% 0.22/0.54 % Propositional clauses after purity: 0
% 0.22/0.54 % Propositional unsat core size : 0
% 0.22/0.54 % Propositional preprocessing time : 0.000
% 0.22/0.54 % Propositional encoding time : 0.000
% 0.22/0.54 % Propositional solver time : 0.000
% 0.22/0.54 % Success case prop preproc time : 0.000
% 0.22/0.54 % Success case prop encoding time : 0.000
% 0.22/0.54 % Success case prop solver time : 0.000
% 0.22/0.54 % Current number of processed clauses : 35
% 0.22/0.54 % Positive orientable unit clauses : 7
% 0.22/0.54 % Positive unorientable unit clauses: 0
% 0.22/0.54 % Negative unit clauses : 3
% 0.22/0.54 % Non-unit-clauses : 25
% 0.22/0.54 % Current number of unprocessed clauses: 1
% 0.22/0.54 % ...number of literals in the above : 4
% 0.22/0.54 % Current number of archived formulas : 0
% 0.22/0.54 % Current number of archived clauses : 0
% 0.22/0.54 % Clause-clause subsumption calls (NU) : 51
% 0.22/0.54 % Rec. Clause-clause subsumption calls : 39
% 0.22/0.54 % Non-unit clause-clause subsumptions : 2
% 0.22/0.54 % Unit Clause-clause subsumption calls : 0
% 0.22/0.54 % Rewrite failures with RHS unbound : 0
% 0.22/0.54 % BW rewrite match attempts : 0
% 0.22/0.54 % BW rewrite match successes : 0
% 0.22/0.54 % Condensation attempts : 0
% 0.22/0.54 % Condensation successes : 0
% 0.22/0.54 % Termbank termtop insertions : 1877
% 0.22/0.54 % Search garbage collected termcells : 333
% 0.22/0.54
% 0.22/0.54 % -------------------------------------------------
% 0.22/0.54 % User time : 0.007 s
% 0.22/0.54 % System time : 0.006 s
% 0.22/0.54 % Total time : 0.013 s
% 0.22/0.54 % Maximum resident set size: 3640 pages
% 0.22/0.54
% 0.22/0.54 % -------------------------------------------------
% 0.22/0.54 % User time : 0.008 s
% 0.22/0.54 % System time : 0.013 s
% 0.22/0.54 % Total time : 0.022 s
% 0.22/0.54 % Maximum resident set size: 4608 pages
% 0.22/0.54 % E exiting
%------------------------------------------------------------------------------