%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SEU102+1 : TPTP v9.3.1. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n026.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:49 PM UTC 2026
% Result : Theorem 0.23s 5.58s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 4
% Syntax : Number of formulae : 25 ( 11 unt; 0 def)
% Number of atoms : 79 ( 7 equ)
% Maximal formula atoms : 5 ( 3 avg)
% Number of connectives : 86 ( 32 ~; 22 |; 22 &)
% ( 0 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-3 aty)
% Number of variables : 44 ( 0 sgn 31 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t13_finsub_1,conjecture,
! [X1,X2,X3] :
( ( preboolean(X3)
& ~ empty(X3) )
=> ( ( element(X2,X3)
& element(X1,X3) )
=> element(set_intersection2(X1,X2),X3) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t13_finsub_1) ).
fof(dt_k2_finsub_1,axiom,
! [X1,X2,X3] :
( ( element(X3,X1)
& element(X2,X1)
& preboolean(X1)
& ~ empty(X1) )
=> element(prebool_difference(X1,X2,X3),X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',dt_k2_finsub_1) ).
fof(redefinition_k2_finsub_1,axiom,
! [X1,X2,X3] :
( ( element(X3,X1)
& element(X2,X1)
& preboolean(X1)
& ~ empty(X1) )
=> prebool_difference(X1,X2,X3) = set_difference(X2,X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',redefinition_k2_finsub_1) ).
fof(t48_xboole_1,axiom,
! [X1,X2] : set_difference(X1,set_difference(X1,X2)) = set_intersection2(X1,X2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t48_xboole_1) ).
fof(c_0_4,negated_conjecture,
~ ! [X1,X2,X3] :
( ( preboolean(X3)
& ~ empty(X3) )
=> ( ( element(X2,X3)
& element(X1,X3) )
=> element(set_intersection2(X1,X2),X3) ) ),
inference(assume_negation,[status(cth)],[t13_finsub_1]) ).
fof(c_0_5,plain,
! [X1,X2,X3] :
( ( element(X3,X1)
& element(X2,X1)
& preboolean(X1)
& ~ empty(X1) )
=> element(prebool_difference(X1,X2,X3),X1) ),
inference(fof_simplification,[status(thm)],[dt_k2_finsub_1]) ).
fof(c_0_6,plain,
! [X1,X2,X3] :
( ( element(X3,X1)
& element(X2,X1)
& preboolean(X1)
& ~ empty(X1) )
=> prebool_difference(X1,X2,X3) = set_difference(X2,X3) ),
inference(fof_simplification,[status(thm)],[redefinition_k2_finsub_1]) ).
fof(c_0_7,negated_conjecture,
~ ! [X1,X2,X3] :
( ( preboolean(X3)
& ~ empty(X3) )
=> ( ( element(X2,X3)
& element(X1,X3) )
=> element(set_intersection2(X1,X2),X3) ) ),
inference(fof_simplification,[status(thm)],[c_0_4]) ).
fof(c_0_8,plain,
! [X13,X14,X15] :
( element(prebool_difference(X13,X14,X15),X13)
| ~ element(X15,X13)
| ~ element(X14,X13)
| ~ preboolean(X13)
| empty(X13) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])]) ).
fof(c_0_9,plain,
! [X40,X41,X42] :
( prebool_difference(X40,X41,X42) = set_difference(X41,X42)
| ~ element(X42,X40)
| ~ element(X41,X40)
| ~ preboolean(X40)
| empty(X40) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])]) ).
fof(c_0_10,negated_conjecture,
( ~ element(set_intersection2(esk11_0,esk12_0),esk13_0)
& element(esk12_0,esk13_0)
& element(esk11_0,esk13_0)
& preboolean(esk13_0)
& ~ empty(esk13_0) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])])]) ).
fof(c_0_11,plain,
! [X55,X56] : set_difference(X55,set_difference(X55,X56)) = set_intersection2(X55,X56),
inference(variable_rename,[status(thm)],[t48_xboole_1]) ).
cnf(c_0_12,plain,
( ~ element(X3,X1)
| ~ element(X2,X1)
| ~ preboolean(X1)
| element(prebool_difference(X1,X2,X3),X1)
| empty(X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,plain,
( ~ element(X3,X1)
| ~ element(X2,X1)
| ~ preboolean(X1)
| prebool_difference(X1,X2,X3) = set_difference(X2,X3)
| empty(X1) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_14,negated_conjecture,
~ element(set_intersection2(esk11_0,esk12_0),esk13_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_15,plain,
set_difference(X1,set_difference(X1,X2)) = set_intersection2(X1,X2),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_16,plain,
( ~ preboolean(X3)
| ~ element(X1,X3)
| ~ element(X2,X3)
| empty(X3)
| element(set_difference(X1,X2),X3) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_17,negated_conjecture,
preboolean(esk13_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_18,negated_conjecture,
~ empty(esk13_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_19,negated_conjecture,
~ element(set_difference(esk11_0,set_difference(esk11_0,esk12_0)),esk13_0),
inference(rw,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_20,negated_conjecture,
( ~ element(X1,esk13_0)
| ~ element(X2,esk13_0)
| element(set_difference(X1,X2),esk13_0) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18]) ).
cnf(c_0_21,negated_conjecture,
element(esk11_0,esk13_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_22,negated_conjecture,
~ element(set_difference(esk11_0,esk12_0),esk13_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21])]) ).
cnf(c_0_23,negated_conjecture,
element(esk12_0,esk13_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_24,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_20]),c_0_23]),c_0_21])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : SEU102+1 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.08 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.18/5.45 % Computer : n026.cluster.edu
% 0.18/5.45 % Model : x86_64 x86_64
% 0.18/5.45 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/5.45 % Memory : 8046.5625MB
% 0.18/5.45 % OS : Linux 6.8.0-71-generic
% 0.18/5.45 % CPULimit : 300
% 0.18/5.45 % WCLimit : 300
% 0.18/5.46 % DateTime : Mon Sep 21 05:53:12 UTC 2026
% 0.18/5.46 % CPUTime :
% 0.18/5.46 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.23/5.51 Running first-order theorem proving
% 0.23/5.51 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.23/5.58 % Version: 3.5.1
% 0.23/5.58 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.23/5.58 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/5.58 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.23/5.58 % Starting new_bool_3 with 300s (1) cores
% 0.23/5.58 % Starting new_bool_1 with 300s (1) cores
% 0.23/5.58 % Starting sh5l with 300s (1) cores
% 0.23/5.58 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 1501123 completed with status 0
% 0.23/5.58 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.23/5.58 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.23/5.58 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/5.58 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.23/5.58 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.23/5.58 % No SInE strategy applied
% 0.23/5.58 % Search class: FGHSM-FFMM31-SFFFFFNN
% 0.23/5.58 % Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 0.23/5.58 % Starting SubtermCWHack with 136s (1) cores
% 0.23/5.58 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.23/5.58 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S4b with 136s (1) cores
% 0.23/5.58 % Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S0Y with 136s (1) cores
% 0.23/5.58 % Starting G-E--_208_B07----D_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.23/5.58 % SubtermCWHack with pid 1501127 completed with status 0
% 0.23/5.58 % Result found by SubtermCWHack
% 0.23/5.58 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.23/5.58 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/5.58 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.23/5.58 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.23/5.58 % No SInE strategy applied
% 0.23/5.58 % Search class: FGHSM-FFMM31-SFFFFFNN
% 0.23/5.58 % Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 0.23/5.58 % Starting SubtermCWHack with 136s (1) cores
% 0.23/5.58 % Preprocessing time : 0.001 s
% 0.23/5.58
% 0.23/5.58 % Proof found!
% 0.23/5.58 % SZS status Theorem
% 0.23/5.58 % SZS output start CNFRefutation
% See solution above
% 0.23/5.58 % Parsed axioms : 38
% 0.23/5.58 % Removed by relevancy pruning/SinE : 0
% 0.23/5.58 % Initial clauses : 64
% 0.23/5.58 % Removed in clause preprocessing : 1
% 0.23/5.58 % Initial clauses in saturation : 63
% 0.23/5.58 % Processed clauses : 288
% 0.23/5.58 % ...of these trivial : 2
% 0.23/5.58 % ...subsumed : 39
% 0.23/5.58 % ...remaining for further processing : 247
% 0.23/5.58 % Other redundant clauses eliminated : 0
% 0.23/5.58 % Clauses deleted for lack of memory : 0
% 0.23/5.58 % Backward-subsumed : 2
% 0.23/5.58 % Backward-rewritten : 11
% 0.23/5.58 % Generated clauses : 568
% 0.23/5.58 % ...of the previous two non-redundant : 523
% 0.23/5.58 % ...aggressively subsumed : 0
% 0.23/5.58 % Contextual simplify-reflections : 35
% 0.23/5.58 % Paramodulations : 568
% 0.23/5.58 % Factorizations : 0
% 0.23/5.58 % NegExts : 0
% 0.23/5.58 % Equation resolutions : 0
% 0.23/5.58 % Disequality decompositions : 0
% 0.23/5.58 % Total rewrite steps : 96
% 0.23/5.58 % ...of those cached : 81
% 0.23/5.58 % Propositional unsat checks : 0
% 0.23/5.58 % Propositional check models : 0
% 0.23/5.58 % Propositional check unsatisfiable : 0
% 0.23/5.58 % Propositional clauses : 0
% 0.23/5.58 % Propositional clauses after purity: 0
% 0.23/5.58 % Propositional unsat core size : 0
% 0.23/5.58 % Propositional preprocessing time : 0.000
% 0.23/5.58 % Propositional encoding time : 0.000
% 0.23/5.58 % Propositional solver time : 0.000
% 0.23/5.58 % Success case prop preproc time : 0.000
% 0.23/5.58 % Success case prop encoding time : 0.000
% 0.23/5.58 % Success case prop solver time : 0.000
% 0.23/5.58 % Current number of processed clauses : 234
% 0.23/5.58 % Positive orientable unit clauses : 27
% 0.23/5.58 % Positive unorientable unit clauses: 1
% 0.23/5.58 % Negative unit clauses : 7
% 0.23/5.58 % Non-unit-clauses : 199
% 0.23/5.58 % Current number of unprocessed clauses: 297
% 0.23/5.58 % ...number of literals in the above : 928
% 0.23/5.58 % Current number of archived formulas : 0
% 0.23/5.58 % Current number of archived clauses : 14
% 0.23/5.58 % Clause-clause subsumption calls (NU) : 4769
% 0.23/5.58 % Rec. Clause-clause subsumption calls : 3262
% 0.23/5.58 % Non-unit clause-clause subsumptions : 76
% 0.23/5.58 % Unit Clause-clause subsumption calls : 12
% 0.23/5.58 % Rewrite failures with RHS unbound : 0
% 0.23/5.58 % BW rewrite match attempts : 15
% 0.23/5.58 % BW rewrite match successes : 7
% 0.23/5.58 % Condensation attempts : 0
% 0.23/5.58 % Condensation successes : 0
% 0.23/5.58 % Termbank termtop insertions : 12982
% 0.23/5.58 % Search garbage collected termcells : 509
% 0.23/5.58
% 0.23/5.58 % -------------------------------------------------
% 0.23/5.58 % User time : 0.019 s
% 0.23/5.58 % System time : 0.006 s
% 0.23/5.58 % Total time : 0.025 s
% 0.23/5.58 % Maximum resident set size: 3664 pages
% 0.23/5.58
% 0.23/5.58 % -------------------------------------------------
% 0.23/5.58 % User time : 0.093 s
% 0.23/5.58 % System time : 0.020 s
% 0.23/5.58 % Total time : 0.113 s
% 0.23/5.58 % Maximum resident set size: 4608 pages
% 0.23/5.58 % E exiting
%------------------------------------------------------------------------------