%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SEU129+1 : 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 : n020.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:53 PM UTC 2026
% Result : Theorem 0.39s 0.48s
% Output : CNFRefutation 0.39s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 4
% Syntax : Number of formulae : 33 ( 9 unt; 0 def)
% Number of atoms : 90 ( 13 equ)
% Maximal formula atoms : 20 ( 2 avg)
% Number of connectives : 93 ( 36 ~; 42 |; 9 &)
% ( 3 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 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-3 aty)
% Number of variables : 81 ( 8 sgn 29 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t26_xboole_1,conjecture,
! [X1,X2,X3] :
( subset(X1,X2)
=> subset(set_intersection2(X1,X3),set_intersection2(X2,X3)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t26_xboole_1) ).
fof(d3_tarski,axiom,
! [X1,X2] :
( subset(X1,X2)
<=> ! [X3] :
( in(X3,X1)
=> in(X3,X2) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d3_tarski) ).
fof(d3_xboole_0,axiom,
! [X1,X2,X3] :
( X3 = set_intersection2(X1,X2)
<=> ! [X4] :
( in(X4,X3)
<=> ( in(X4,X2)
& in(X4,X1) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d3_xboole_0) ).
fof(idempotence_k3_xboole_0,axiom,
! [X1,X2] : set_intersection2(X1,X1) = X1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',idempotence_k3_xboole_0) ).
fof(c_0_4,negated_conjecture,
~ ! [X1,X2,X3] :
( subset(X1,X2)
=> subset(set_intersection2(X1,X3),set_intersection2(X2,X3)) ),
inference(assume_negation,[status(cth)],[t26_xboole_1]) ).
fof(c_0_5,plain,
! [X9,X10,X11,X12,X13] :
( ( subset(X12,X13)
| ~ in(esk1_2(X12,X13),X13) )
& ( subset(X12,X13)
| in(esk1_2(X12,X13),X12) )
& ( in(X11,X10)
| ~ in(X11,X9)
| ~ subset(X9,X10) ) ),
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)],[d3_tarski])])])])])])]) ).
fof(c_0_6,negated_conjecture,
( ~ subset(set_intersection2(esk5_0,esk7_0),set_intersection2(esk6_0,esk7_0))
& subset(esk5_0,esk6_0) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])])]) ).
fof(c_0_7,plain,
! [X15,X16,X17,X18,X19,X20,X21,X22] :
( ( X22 = set_intersection2(X20,X21)
| in(esk2_3(X20,X21,X22),X22)
| in(esk2_3(X20,X21,X22),X21) )
& ( X22 = set_intersection2(X20,X21)
| in(esk2_3(X20,X21,X22),X22)
| in(esk2_3(X20,X21,X22),X20) )
& ( X22 = set_intersection2(X20,X21)
| ~ in(esk2_3(X20,X21,X22),X21)
| ~ in(esk2_3(X20,X21,X22),X20)
| ~ in(esk2_3(X20,X21,X22),X22) )
& ( X17 != set_intersection2(X15,X16)
| in(X19,X17)
| ~ in(X19,X16)
| ~ in(X19,X15) )
& ( X17 != set_intersection2(X15,X16)
| ~ in(X18,X17)
| in(X18,X16) )
& ( X17 != set_intersection2(X15,X16)
| ~ in(X18,X17)
| in(X18,X15) ) ),
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)],[d3_xboole_0])])])])])])]) ).
cnf(c_0_8,plain,
( ~ in(X3,X1)
| ~ subset(X1,X2)
| in(X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,negated_conjecture,
subset(esk5_0,esk6_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,plain,
( X3 != set_intersection2(X4,X2)
| ~ in(X1,X3)
| in(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_11,plain,
( ~ in(esk1_2(X1,X2),X2)
| subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_12,negated_conjecture,
( ~ in(X1,esk5_0)
| in(X1,esk6_0) ),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_13,plain,
( ~ in(X1,set_intersection2(X3,X2))
| in(X1,X2) ),
inference(er,[status(thm)],[c_0_10]) ).
cnf(c_0_14,plain,
( subset(X1,X2)
| in(esk1_2(X1,X2),X1) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_15,plain,
( X4 != set_intersection2(X2,X3)
| ~ in(X1,X3)
| ~ in(X1,X2)
| in(X1,X4) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_16,negated_conjecture,
( ~ in(esk1_2(X1,esk6_0),esk5_0)
| subset(X1,esk6_0) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_17,plain,
( in(esk1_2(set_intersection2(X1,X2),X3),X2)
| subset(set_intersection2(X1,X2),X3) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_18,plain,
( X3 != set_intersection2(X2,X4)
| ~ in(X1,X3)
| in(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_19,plain,
( ~ in(X1,X2)
| ~ in(X1,X3)
| in(X1,set_intersection2(X2,X3)) ),
inference(er,[status(thm)],[c_0_15]) ).
cnf(c_0_20,negated_conjecture,
subset(set_intersection2(X1,esk5_0),esk6_0),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_21,plain,
( ~ in(X1,set_intersection2(X2,X3))
| in(X1,X2) ),
inference(er,[status(thm)],[c_0_18]) ).
cnf(c_0_22,plain,
( ~ in(esk1_2(X1,set_intersection2(X2,X3)),X2)
| ~ in(esk1_2(X1,set_intersection2(X2,X3)),X3)
| subset(X1,set_intersection2(X2,X3)) ),
inference(spm,[status(thm)],[c_0_11,c_0_19]) ).
cnf(c_0_23,negated_conjecture,
( ~ in(X1,set_intersection2(X2,esk5_0))
| in(X1,esk6_0) ),
inference(spm,[status(thm)],[c_0_8,c_0_20]) ).
cnf(c_0_24,plain,
( in(esk1_2(set_intersection2(X1,X2),X3),X1)
| subset(set_intersection2(X1,X2),X3) ),
inference(spm,[status(thm)],[c_0_21,c_0_14]) ).
cnf(c_0_25,plain,
( ~ in(esk1_2(set_intersection2(X1,X2),set_intersection2(X3,X2)),X3)
| subset(set_intersection2(X1,X2),set_intersection2(X3,X2)) ),
inference(spm,[status(thm)],[c_0_22,c_0_17]) ).
cnf(c_0_26,negated_conjecture,
( in(esk1_2(set_intersection2(set_intersection2(X1,esk5_0),X2),X3),esk6_0)
| subset(set_intersection2(set_intersection2(X1,esk5_0),X2),X3) ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
fof(c_0_27,plain,
! [X24] : set_intersection2(X24,X24) = X24,
inference(variable_rename,[status(thm)],[inference(fof_simplification,[status(thm)],[idempotence_k3_xboole_0])]) ).
cnf(c_0_28,negated_conjecture,
subset(set_intersection2(set_intersection2(X1,esk5_0),X2),set_intersection2(esk6_0,X2)),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_29,plain,
set_intersection2(X1,X1) = X1,
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_30,negated_conjecture,
~ subset(set_intersection2(esk5_0,esk7_0),set_intersection2(esk6_0,esk7_0)),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_31,negated_conjecture,
subset(set_intersection2(esk5_0,X1),set_intersection2(esk6_0,X1)),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_32,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_30,c_0_31])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU129+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.12/0.36 % Computer : n020.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.36 % CPULimit : 300
% 0.12/0.36 % WCLimit : 300
% 0.12/0.36 % DateTime : Mon Sep 21 05:52:32 UTC 2026
% 0.12/0.37 % CPUTime :
% 0.12/0.37 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.12/0.41 Running first-order theorem proving
% 0.12/0.41 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.39/0.48 % Version: 3.5.1
% 0.39/0.48 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.39/0.48 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.39/0.48 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.39/0.48 % Starting new_bool_3 with 300s (1) cores
% 0.39/0.48 % Starting new_bool_1 with 300s (1) cores
% 0.39/0.48 % Starting sh5l with 300s (1) cores
% 0.39/0.48 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 2143256 completed with status 0
% 0.39/0.48 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.39/0.48 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.39/0.48 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.39/0.48 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.39/0.48 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.39/0.48 % No SInE strategy applied
% 0.39/0.48 % Search class: FGHSM-FFSS32-SFFFFFNN
% 0.39/0.48 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.39/0.48 % Starting SubtermCWHack with 136s (1) cores
% 0.39/0.48 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.39/0.48 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.39/0.48 % Starting new_bool_3 with 136s (1) cores
% 0.39/0.48 % Starting new_bool_1 with 136s (1) cores
% 0.39/0.48 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 2143261 completed with status 0
% 0.39/0.48 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.39/0.48 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.39/0.48 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.39/0.48 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.39/0.48 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.39/0.48 % No SInE strategy applied
% 0.39/0.48 % Search class: FGHSM-FFSS32-SFFFFFNN
% 0.39/0.48 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.39/0.48 % Starting SubtermCWHack with 136s (1) cores
% 0.39/0.48 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.39/0.48 % Preprocessing time : 0.001 s
% 0.39/0.48 % Presaturation interreduction done
% 0.39/0.48
% 0.39/0.48 % Proof found!
% 0.39/0.48 % SZS status Theorem
% 0.39/0.48 % SZS output start CNFRefutation
% See solution above
% 0.39/0.48 % Parsed axioms : 16
% 0.39/0.48 % Removed by relevancy pruning/SinE : 0
% 0.39/0.48 % Initial clauses : 24
% 0.39/0.48 % Removed in clause preprocessing : 2
% 0.39/0.48 % Initial clauses in saturation : 22
% 0.39/0.48 % Processed clauses : 617
% 0.39/0.48 % ...of these trivial : 39
% 0.39/0.48 % ...subsumed : 360
% 0.39/0.48 % ...remaining for further processing : 218
% 0.39/0.48 % Other redundant clauses eliminated : 3
% 0.39/0.48 % Clauses deleted for lack of memory : 0
% 0.39/0.48 % Backward-subsumed : 6
% 0.39/0.48 % Backward-rewritten : 17
% 0.39/0.48 % Generated clauses : 2017
% 0.39/0.48 % ...of the previous two non-redundant : 1680
% 0.39/0.48 % ...aggressively subsumed : 0
% 0.39/0.48 % Contextual simplify-reflections : 6
% 0.39/0.48 % Paramodulations : 1986
% 0.39/0.48 % Factorizations : 28
% 0.39/0.48 % NegExts : 0
% 0.39/0.48 % Equation resolutions : 3
% 0.39/0.48 % Disequality decompositions : 0
% 0.39/0.48 % Total rewrite steps : 898
% 0.39/0.48 % ...of those cached : 804
% 0.39/0.48 % Propositional unsat checks : 0
% 0.39/0.48 % Propositional check models : 0
% 0.39/0.48 % Propositional check unsatisfiable : 0
% 0.39/0.48 % Propositional clauses : 0
% 0.39/0.48 % Propositional clauses after purity: 0
% 0.39/0.48 % Propositional unsat core size : 0
% 0.39/0.48 % Propositional preprocessing time : 0.000
% 0.39/0.48 % Propositional encoding time : 0.000
% 0.39/0.48 % Propositional solver time : 0.000
% 0.39/0.48 % Success case prop preproc time : 0.000
% 0.39/0.48 % Success case prop encoding time : 0.000
% 0.39/0.48 % Success case prop solver time : 0.000
% 0.39/0.48 % Current number of processed clauses : 170
% 0.39/0.48 % Positive orientable unit clauses : 32
% 0.39/0.48 % Positive unorientable unit clauses: 1
% 0.39/0.48 % Negative unit clauses : 10
% 0.39/0.48 % Non-unit-clauses : 127
% 0.39/0.48 % Current number of unprocessed clauses: 1086
% 0.39/0.48 % ...number of literals in the above : 3042
% 0.39/0.48 % Current number of archived formulas : 0
% 0.39/0.48 % Current number of archived clauses : 45
% 0.39/0.48 % Clause-clause subsumption calls (NU) : 4007
% 0.39/0.48 % Rec. Clause-clause subsumption calls : 3250
% 0.39/0.48 % Non-unit clause-clause subsumptions : 260
% 0.39/0.48 % Unit Clause-clause subsumption calls : 278
% 0.39/0.48 % Rewrite failures with RHS unbound : 0
% 0.39/0.48 % BW rewrite match attempts : 74
% 0.39/0.48 % BW rewrite match successes : 23
% 0.39/0.48 % Condensation attempts : 0
% 0.39/0.48 % Condensation successes : 0
% 0.39/0.48 % Termbank termtop insertions : 26627
% 0.39/0.48 % Search garbage collected termcells : 336
% 0.39/0.48
% 0.39/0.48 % -------------------------------------------------
% 0.39/0.48 % User time : 0.042 s
% 0.39/0.48 % System time : 0.006 s
% 0.39/0.48 % Total time : 0.048 s
% 0.39/0.48 % Maximum resident set size: 3384 pages
% 0.39/0.48
% 0.39/0.48 % -------------------------------------------------
% 0.39/0.48 % User time : 0.176 s
% 0.39/0.48 % System time : 0.021 s
% 0.39/0.48 % Total time : 0.197 s
% 0.39/0.48 % Maximum resident set size: 4608 pages
% 0.39/0.48 % E exiting
%------------------------------------------------------------------------------