%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SEU167+2 : TPTP v9.3.1. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n006.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:24:05 PM UTC 2026
% Result : Theorem 0.24s 0.61s
% Output : CNFRefutation 0.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 3
% Syntax : Number of formulae : 16 ( 4 unt; 0 def)
% Number of atoms : 39 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 38 ( 15 ~; 12 |; 7 &)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 37 ( 0 sgn 20 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t1_xboole_1,lemma,
! [X1,X2,X3] :
( ( subset(X2,X3)
& subset(X1,X2) )
=> subset(X1,X3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t1_xboole_1) ).
fof(t118_zfmisc_1,lemma,
! [X1,X2,X3] :
( subset(X1,X2)
=> ( subset(cartesian_product2(X3,X1),cartesian_product2(X3,X2))
& subset(cartesian_product2(X1,X3),cartesian_product2(X2,X3)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t118_zfmisc_1) ).
fof(t119_zfmisc_1,conjecture,
! [X1,X2,X3,X4] :
( ( subset(X3,X4)
& subset(X1,X2) )
=> subset(cartesian_product2(X1,X3),cartesian_product2(X2,X4)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t119_zfmisc_1) ).
fof(c_0_3,lemma,
! [X20,X21,X22] :
( subset(X20,X22)
| ~ subset(X21,X22)
| ~ subset(X20,X21) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t1_xboole_1])])]) ).
fof(c_0_4,lemma,
! [X48,X49,X50] :
( ( ~ subset(X48,X49)
| subset(cartesian_product2(X50,X48),cartesian_product2(X50,X49)) )
& ( ~ subset(X48,X49)
| subset(cartesian_product2(X48,X50),cartesian_product2(X49,X50)) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t118_zfmisc_1])])])]) ).
fof(c_0_5,negated_conjecture,
~ ! [X1,X2,X3,X4] :
( ( subset(X3,X4)
& subset(X1,X2) )
=> subset(cartesian_product2(X1,X3),cartesian_product2(X2,X4)) ),
inference(assume_negation,[status(cth)],[t119_zfmisc_1]) ).
cnf(c_0_6,lemma,
( ~ subset(X2,X3)
| ~ subset(X1,X2)
| subset(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_7,lemma,
( ~ subset(X1,X3)
| subset(cartesian_product2(X1,X2),cartesian_product2(X3,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
fof(c_0_8,negated_conjecture,
( ~ subset(cartesian_product2(esk1_0,esk3_0),cartesian_product2(esk2_0,esk4_0))
& subset(esk3_0,esk4_0)
& subset(esk1_0,esk2_0) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])])]) ).
cnf(c_0_9,lemma,
( ~ subset(X4,X2)
| ~ subset(X1,cartesian_product2(X4,X3))
| subset(X1,cartesian_product2(X2,X3)) ),
inference(spm,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_10,lemma,
( ~ subset(X2,X3)
| subset(cartesian_product2(X1,X2),cartesian_product2(X1,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_11,negated_conjecture,
~ subset(cartesian_product2(esk1_0,esk3_0),cartesian_product2(esk2_0,esk4_0)),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_12,lemma,
( ~ subset(X2,X4)
| ~ subset(X1,X3)
| subset(cartesian_product2(X1,X2),cartesian_product2(X3,X4)) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_13,negated_conjecture,
subset(esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_14,negated_conjecture,
subset(esk3_0,esk4_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_15,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_13]),c_0_14])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : SEU167+2 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.08 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.16/0.43 % Computer : n006.cluster.edu
% 0.16/0.43 % Model : x86_64 x86_64
% 0.16/0.43 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.43 % Memory : 8046.5625MB
% 0.16/0.43 % OS : Linux 6.8.0-71-generic
% 0.16/0.43 % CPULimit : 300
% 0.16/0.43 % WCLimit : 300
% 0.16/0.43 % DateTime : Mon Sep 21 05:53:57 UTC 2026
% 0.16/0.43 % CPUTime :
% 0.16/0.43 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.24/0.50 Running first-order theorem proving
% 0.24/0.50 Running: /export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p
% 0.24/0.61 % Version: 3.5.1
% 0.24/0.61 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.24/0.61 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.61 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.24/0.61 % Starting new_bool_3 with 300s (1) cores
% 0.24/0.61 % Starting new_bool_1 with 300s (1) cores
% 0.24/0.61 % Starting sh5l with 300s (1) cores
% 0.24/0.61 % new_bool_3 with pid 2136647 completed with status 0
% 0.24/0.61 % Result found by new_bool_3
% 0.24/0.61 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.24/0.61 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.61 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.24/0.61 % Starting new_bool_3 with 300s (1) cores
% 0.24/0.61 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.24/0.61 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.24/0.61 % Search class: FGHSM-FFMS32-SFFFFFNN
% 0.24/0.61 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.24/0.61 % Starting SubtermCWHack with 31s (1) cores
% 0.24/0.61 % SubtermCWHack with pid 2136650 completed with status 0
% 0.24/0.61 % Result found by SubtermCWHack
% 0.24/0.61 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.24/0.61 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.61 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.24/0.61 % Starting new_bool_3 with 300s (1) cores
% 0.24/0.61 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.24/0.61 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.24/0.61 % Search class: FGHSM-FFMS32-SFFFFFNN
% 0.24/0.61 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.24/0.61 % Starting SubtermCWHack with 31s (1) cores
% 0.24/0.61 % Preprocessing time : 0.003 s
% 0.24/0.61
% 0.24/0.61 % Proof found!
% 0.24/0.61 % SZS status Theorem
% 0.24/0.61 % SZS output start CNFRefutation
% See solution above
% 0.24/0.61 % Parsed axioms : 97
% 0.24/0.61 % Removed by relevancy pruning/SinE : 57
% 0.24/0.61 % Initial clauses : 77
% 0.24/0.61 % Removed in clause preprocessing : 0
% 0.24/0.61 % Initial clauses in saturation : 77
% 0.24/0.61 % Processed clauses : 1091
% 0.24/0.61 % ...of these trivial : 14
% 0.24/0.61 % ...subsumed : 697
% 0.24/0.61 % ...remaining for further processing : 380
% 0.24/0.61 % Other redundant clauses eliminated : 24
% 0.24/0.61 % Clauses deleted for lack of memory : 0
% 0.24/0.61 % Backward-subsumed : 11
% 0.24/0.61 % Backward-rewritten : 4
% 0.24/0.61 % Generated clauses : 3801
% 0.24/0.61 % ...of the previous two non-redundant : 3403
% 0.24/0.61 % ...aggressively subsumed : 0
% 0.24/0.61 % Contextual simplify-reflections : 2
% 0.24/0.61 % Paramodulations : 3771
% 0.24/0.61 % Factorizations : 4
% 0.24/0.61 % NegExts : 0
% 0.24/0.61 % Equation resolutions : 30
% 0.24/0.61 % Disequality decompositions : 0
% 0.24/0.61 % Total rewrite steps : 711
% 0.24/0.61 % ...of those cached : 615
% 0.24/0.61 % Propositional unsat checks : 0
% 0.24/0.61 % Propositional check models : 0
% 0.24/0.61 % Propositional check unsatisfiable : 0
% 0.24/0.61 % Propositional clauses : 0
% 0.24/0.61 % Propositional clauses after purity: 0
% 0.24/0.61 % Propositional unsat core size : 0
% 0.24/0.61 % Propositional preprocessing time : 0.000
% 0.24/0.61 % Propositional encoding time : 0.000
% 0.24/0.61 % Propositional solver time : 0.000
% 0.24/0.61 % Success case prop preproc time : 0.000
% 0.24/0.61 % Success case prop encoding time : 0.000
% 0.24/0.61 % Success case prop solver time : 0.000
% 0.24/0.61 % Current number of processed clauses : 350
% 0.24/0.61 % Positive orientable unit clauses : 33
% 0.24/0.61 % Positive unorientable unit clauses: 1
% 0.24/0.61 % Negative unit clauses : 32
% 0.24/0.61 % Non-unit-clauses : 284
% 0.24/0.61 % Current number of unprocessed clauses: 2327
% 0.24/0.61 % ...number of literals in the above : 8633
% 0.24/0.61 % Current number of archived formulas : 0
% 0.24/0.61 % Current number of archived clauses : 15
% 0.24/0.61 % Clause-clause subsumption calls (NU) : 10871
% 0.24/0.61 % Rec. Clause-clause subsumption calls : 9445
% 0.24/0.61 % Non-unit clause-clause subsumptions : 476
% 0.24/0.61 % Unit Clause-clause subsumption calls : 377
% 0.24/0.61 % Rewrite failures with RHS unbound : 0
% 0.24/0.61 % BW rewrite match attempts : 22
% 0.24/0.61 % BW rewrite match successes : 6
% 0.24/0.61 % Condensation attempts : 0
% 0.24/0.61 % Condensation successes : 0
% 0.24/0.61 % Termbank termtop insertions : 49897
% 0.24/0.61 % Search garbage collected termcells : 1410
% 0.24/0.61
% 0.24/0.61 % -------------------------------------------------
% 0.24/0.61 % User time : 0.074 s
% 0.24/0.61 % System time : 0.003 s
% 0.24/0.61 % Total time : 0.077 s
% 0.24/0.61 % Maximum resident set size: 3712 pages
% 0.24/0.61
% 0.24/0.61 % -------------------------------------------------
% 0.24/0.61 % User time : 0.076 s
% 0.24/0.61 % System time : 0.009 s
% 0.24/0.61 % Total time : 0.084 s
% 0.24/0.61 % Maximum resident set size: 4608 pages
% 0.24/0.61 % E exiting
%------------------------------------------------------------------------------