%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SEU139+2 : TPTP v9.3.1. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n012.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:23:56 PM UTC 2026
% Result : Theorem 0.10s 0.44s
% Output : CNFRefutation 0.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 4
% Syntax : Number of formulae : 20 ( 9 unt; 0 def)
% Number of atoms : 39 ( 6 equ)
% Maximal formula atoms : 7 ( 1 avg)
% Number of connectives : 40 ( 21 ~; 8 |; 7 &)
% ( 2 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 2 ( 2 usr; 2 con; 0-0 aty)
% Number of variables : 26 ( 2 sgn 21 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(antisymmetry_r2_xboole_0,axiom,
! [X1,X2] :
( proper_subset(X1,X2)
=> ~ proper_subset(X2,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',antisymmetry_r2_xboole_0) ).
fof(t60_xboole_1,conjecture,
! [X1,X2] :
~ ( proper_subset(X2,X1)
& subset(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t60_xboole_1) ).
fof(d8_xboole_0,axiom,
! [X1,X2] :
( proper_subset(X1,X2)
<=> ( X1 != X2
& subset(X1,X2) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d8_xboole_0) ).
fof(irreflexivity_r2_xboole_0,axiom,
! [X1,X2] : ~ proper_subset(X1,X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',irreflexivity_r2_xboole_0) ).
fof(c_0_4,plain,
! [X1,X2] :
( proper_subset(X1,X2)
=> ~ proper_subset(X2,X1) ),
inference(fof_simplification,[status(thm)],[antisymmetry_r2_xboole_0]) ).
fof(c_0_5,negated_conjecture,
~ ! [X1,X2] :
~ ( proper_subset(X2,X1)
& subset(X1,X2) ),
inference(assume_negation,[status(cth)],[t60_xboole_1]) ).
fof(c_0_6,plain,
! [X7,X8] :
( ~ proper_subset(X8,X7)
| ~ proper_subset(X7,X8) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])]) ).
fof(c_0_7,negated_conjecture,
( proper_subset(esk2_0,esk1_0)
& subset(esk1_0,esk2_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])]) ).
fof(c_0_8,plain,
! [X1,X2] :
( proper_subset(X1,X2)
<=> ( X1 != X2
& subset(X1,X2) ) ),
inference(fof_simplification,[status(thm)],[d8_xboole_0]) ).
cnf(c_0_9,plain,
( ~ proper_subset(X2,X1)
| ~ proper_subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,negated_conjecture,
proper_subset(esk2_0,esk1_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
fof(c_0_11,plain,
! [X9,X10] :
( ( proper_subset(X9,X10)
| X9 = X10
| ~ subset(X9,X10) )
& ( ~ proper_subset(X9,X10)
| X9 != X10 )
& ( ~ proper_subset(X9,X10)
| subset(X9,X10) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_8])])])]) ).
fof(c_0_12,plain,
! [X1,X2] : ~ proper_subset(X1,X1),
inference(fof_simplification,[status(thm)],[irreflexivity_r2_xboole_0]) ).
cnf(c_0_13,negated_conjecture,
~ proper_subset(esk1_0,esk2_0),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_14,plain,
( ~ subset(X1,X2)
| proper_subset(X1,X2)
| X1 = X2 ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_15,negated_conjecture,
subset(esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
fof(c_0_16,plain,
! [X11] : ~ proper_subset(X11,X11),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_simplification,[status(thm)],[c_0_12])])]) ).
cnf(c_0_17,negated_conjecture,
esk1_0 = esk2_0,
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,plain,
~ proper_subset(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_19,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_10,c_0_17]),c_0_18]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SEU139+2 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.36 % Computer : n012.cluster.edu
% 0.09/0.36 % Model : x86_64 x86_64
% 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36 % Memory : 8046.5625MB
% 0.09/0.36 % OS : Linux 6.8.0-71-generic
% 0.09/0.36 % CPULimit : 300
% 0.09/0.36 % WCLimit : 300
% 0.10/0.36 % DateTime : Mon Sep 21 05:52:06 UTC 2026
% 0.10/0.36 % CPUTime :
% 0.10/0.36 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.40 Running first-order theorem proving
% 0.10/0.40 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.10/0.44 % Version: 3.5.1
% 0.10/0.44 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.10/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.10/0.44 % Starting new_bool_3 with 300s (1) cores
% 0.10/0.44 % Starting new_bool_1 with 300s (1) cores
% 0.10/0.44 % Starting sh5l with 300s (1) cores
% 0.10/0.44 % new_bool_1 with pid 1685457 completed with status 0
% 0.10/0.44 % Result found by new_bool_1
% 0.10/0.44 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.10/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.10/0.44 % Starting new_bool_3 with 300s (1) cores
% 0.10/0.44 % Starting new_bool_1 with 300s (1) cores
% 0.10/0.44 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.10/0.44 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.10/0.44 % Search class: FGHSF-FFSF00-SFFFFFNN
% 0.10/0.44 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.10/0.44 % Starting SubtermCWHack with 31s (1) cores
% 0.10/0.44 % SubtermCWHack with pid 1685460 completed with status 0
% 0.10/0.44 % Result found by SubtermCWHack
% 0.10/0.44 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.10/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.10/0.44 % Starting new_bool_3 with 300s (1) cores
% 0.10/0.44 % Starting new_bool_1 with 300s (1) cores
% 0.10/0.44 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.10/0.44 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.10/0.44 % Search class: FGHSF-FFSF00-SFFFFFNN
% 0.10/0.44 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.10/0.44 % Starting SubtermCWHack with 31s (1) cores
% 0.10/0.44 % Preprocessing time : 0.001 s
% 0.10/0.44
% 0.10/0.44 % Proof found!
% 0.10/0.44 % SZS status Theorem
% 0.10/0.44 % SZS output start CNFRefutation
% See solution above
% 0.10/0.44 % Parsed axioms : 55
% 0.10/0.44 % Removed by relevancy pruning/SinE : 48
% 0.10/0.44 % Initial clauses : 12
% 0.10/0.44 % Removed in clause preprocessing : 0
% 0.10/0.44 % Initial clauses in saturation : 12
% 0.10/0.44 % Processed clauses : 14
% 0.10/0.44 % ...of these trivial : 0
% 0.10/0.44 % ...subsumed : 1
% 0.10/0.44 % ...remaining for further processing : 13
% 0.10/0.44 % Other redundant clauses eliminated : 3
% 0.10/0.44 % Clauses deleted for lack of memory : 0
% 0.10/0.44 % Backward-subsumed : 0
% 0.10/0.44 % Backward-rewritten : 4
% 0.10/0.44 % Generated clauses : 8
% 0.10/0.44 % ...of the previous two non-redundant : 6
% 0.10/0.44 % ...aggressively subsumed : 0
% 0.10/0.44 % Contextual simplify-reflections : 0
% 0.10/0.44 % Paramodulations : 5
% 0.10/0.44 % Factorizations : 0
% 0.10/0.44 % NegExts : 0
% 0.10/0.44 % Equation resolutions : 3
% 0.10/0.44 % Disequality decompositions : 0
% 0.10/0.44 % Total rewrite steps : 9
% 0.10/0.44 % ...of those cached : 5
% 0.10/0.44 % Propositional unsat checks : 0
% 0.10/0.44 % Propositional check models : 0
% 0.10/0.44 % Propositional check unsatisfiable : 0
% 0.10/0.44 % Propositional clauses : 0
% 0.10/0.44 % Propositional clauses after purity: 0
% 0.10/0.44 % Propositional unsat core size : 0
% 0.10/0.44 % Propositional preprocessing time : 0.000
% 0.10/0.44 % Propositional encoding time : 0.000
% 0.10/0.44 % Propositional solver time : 0.000
% 0.10/0.44 % Success case prop preproc time : 0.000
% 0.10/0.44 % Success case prop encoding time : 0.000
% 0.10/0.44 % Success case prop solver time : 0.000
% 0.10/0.44 % Current number of processed clauses : 6
% 0.10/0.44 % Positive orientable unit clauses : 2
% 0.10/0.44 % Positive unorientable unit clauses: 0
% 0.10/0.44 % Negative unit clauses : 1
% 0.10/0.44 % Non-unit-clauses : 3
% 0.10/0.44 % Current number of unprocessed clauses: 3
% 0.10/0.44 % ...number of literals in the above : 9
% 0.10/0.44 % Current number of archived formulas : 0
% 0.10/0.44 % Current number of archived clauses : 4
% 0.10/0.44 % Clause-clause subsumption calls (NU) : 0
% 0.10/0.44 % Rec. Clause-clause subsumption calls : 0
% 0.10/0.44 % Non-unit clause-clause subsumptions : 0
% 0.10/0.44 % Unit Clause-clause subsumption calls : 3
% 0.10/0.44 % Rewrite failures with RHS unbound : 0
% 0.10/0.44 % BW rewrite match attempts : 2
% 0.10/0.44 % BW rewrite match successes : 1
% 0.10/0.44 % Condensation attempts : 0
% 0.10/0.44 % Condensation successes : 0
% 0.10/0.44 % Termbank termtop insertions : 970
% 0.10/0.44 % Search garbage collected termcells : 354
% 0.10/0.44
% 0.10/0.44 % -------------------------------------------------
% 0.10/0.44 % User time : 0.002 s
% 0.10/0.44 % System time : 0.002 s
% 0.10/0.44 % Total time : 0.004 s
% 0.10/0.44 % Maximum resident set size: 3672 pages
% 0.10/0.44
% 0.10/0.44 % -------------------------------------------------
% 0.10/0.44 % User time : 0.003 s
% 0.10/0.44 % System time : 0.007 s
% 0.10/0.44 % Total time : 0.010 s
% 0.10/0.44 % Maximum resident set size: 4864 pages
% 0.10/0.44 % E exiting
%------------------------------------------------------------------------------