%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SEU056+1 : TPTP v9.3.1. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n001.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:45 PM UTC 2026
% Result : Theorem 0.24s 0.56s
% Output : CNFRefutation 0.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 6
% Syntax : Number of formulae : 29 ( 13 unt; 0 def)
% Number of atoms : 62 ( 17 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 52 ( 19 ~; 14 |; 10 &)
% ( 1 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-2 aty)
% Number of variables : 38 ( 0 sgn 26 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t125_funct_1,conjecture,
! [X1,X2,X3] :
( ( function(X3)
& relation(X3) )
=> ( ( one_to_one(X3)
& disjoint(X1,X2) )
=> disjoint(relation_image(X3,X1),relation_image(X3,X2)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t125_funct_1) ).
fof(symmetry_r1_xboole_0,axiom,
! [X1,X2] :
( disjoint(X1,X2)
=> disjoint(X2,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',symmetry_r1_xboole_0) ).
fof(d7_xboole_0,axiom,
! [X1,X2] :
( disjoint(X1,X2)
<=> set_intersection2(X1,X2) = empty_set ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d7_xboole_0) ).
fof(commutativity_k3_xboole_0,axiom,
! [X1,X2] : set_intersection2(X1,X2) = set_intersection2(X2,X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',commutativity_k3_xboole_0) ).
fof(t121_funct_1,axiom,
! [X1,X2,X3] :
( ( function(X3)
& relation(X3) )
=> ( one_to_one(X3)
=> relation_image(X3,set_intersection2(X1,X2)) = set_intersection2(relation_image(X3,X1),relation_image(X3,X2)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t121_funct_1) ).
fof(t149_relat_1,axiom,
! [X1] :
( relation(X1)
=> relation_image(X1,empty_set) = empty_set ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t149_relat_1) ).
fof(c_0_6,negated_conjecture,
~ ! [X1,X2,X3] :
( ( function(X3)
& relation(X3) )
=> ( ( one_to_one(X3)
& disjoint(X1,X2) )
=> disjoint(relation_image(X3,X1),relation_image(X3,X2)) ) ),
inference(assume_negation,[status(cth)],[t125_funct_1]) ).
fof(c_0_7,plain,
! [X9,X10] :
( disjoint(X10,X9)
| ~ disjoint(X9,X10) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[symmetry_r1_xboole_0])])]) ).
fof(c_0_8,negated_conjecture,
( ~ disjoint(relation_image(esk3_0,esk1_0),relation_image(esk3_0,esk2_0))
& one_to_one(esk3_0)
& disjoint(esk1_0,esk2_0)
& function(esk3_0)
& relation(esk3_0) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])])]) ).
fof(c_0_9,plain,
! [X7,X8] :
( ( disjoint(X7,X8)
| set_intersection2(X7,X8) != empty_set )
& ( set_intersection2(X7,X8) = empty_set
| ~ disjoint(X7,X8) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d7_xboole_0])])]) ).
cnf(c_0_10,plain,
( ~ disjoint(X1,X2)
| disjoint(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_11,negated_conjecture,
disjoint(esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
fof(c_0_12,plain,
! [X25,X26] : set_intersection2(X25,X26) = set_intersection2(X26,X25),
inference(variable_rename,[status(thm)],[commutativity_k3_xboole_0]) ).
cnf(c_0_13,negated_conjecture,
~ disjoint(relation_image(esk3_0,esk1_0),relation_image(esk3_0,esk2_0)),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_14,plain,
( set_intersection2(X1,X2) != empty_set
| disjoint(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
fof(c_0_15,plain,
! [X11,X12,X13] :
( relation_image(X13,set_intersection2(X11,X12)) = set_intersection2(relation_image(X13,X11),relation_image(X13,X12))
| ~ one_to_one(X13)
| ~ function(X13)
| ~ relation(X13) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t121_funct_1])])]) ).
cnf(c_0_16,plain,
( ~ disjoint(X1,X2)
| set_intersection2(X1,X2) = empty_set ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_17,negated_conjecture,
disjoint(esk2_0,esk1_0),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_18,plain,
set_intersection2(X1,X2) = set_intersection2(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_19,negated_conjecture,
set_intersection2(relation_image(esk3_0,esk1_0),relation_image(esk3_0,esk2_0)) != empty_set,
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_20,plain,
( ~ one_to_one(X1)
| ~ function(X1)
| ~ relation(X1)
| relation_image(X1,set_intersection2(X2,X3)) = set_intersection2(relation_image(X1,X2),relation_image(X1,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_21,negated_conjecture,
set_intersection2(esk1_0,esk2_0) = empty_set,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18]) ).
cnf(c_0_22,negated_conjecture,
one_to_one(esk3_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_23,negated_conjecture,
relation(esk3_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_24,negated_conjecture,
function(esk3_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
fof(c_0_25,plain,
! [X14] :
( relation_image(X14,empty_set) = empty_set
| ~ relation(X14) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t149_relat_1])])]) ).
cnf(c_0_26,negated_conjecture,
relation_image(esk3_0,empty_set) != empty_set,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21]),c_0_22]),c_0_23]),c_0_24])]) ).
cnf(c_0_27,plain,
( ~ relation(X1)
| relation_image(X1,empty_set) = empty_set ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_28,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_23])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : SEU056+1 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.08 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.19/0.45 % Computer : n001.cluster.edu
% 0.19/0.45 % Model : x86_64 x86_64
% 0.19/0.45 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.19/0.45 % Memory : 8046.5625MB
% 0.19/0.45 % OS : Linux 6.8.0-71-generic
% 0.19/0.45 % CPULimit : 300
% 0.19/0.45 % WCLimit : 300
% 0.19/0.45 % DateTime : Mon Sep 21 05:53:58 UTC 2026
% 0.19/0.46 % CPUTime :
% 0.19/0.46 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.24/0.53 Running first-order theorem proving
% 0.24/0.53 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.56 % Version: 3.5.1
% 0.24/0.56 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.24/0.56 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.56 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.24/0.56 % Starting new_bool_3 with 300s (1) cores
% 0.24/0.56 % Starting new_bool_1 with 300s (1) cores
% 0.24/0.56 % Starting sh5l with 300s (1) cores
% 0.24/0.56 % new_bool_3 with pid 2324234 completed with status 0
% 0.24/0.56 % Result found by new_bool_3
% 0.24/0.56 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.24/0.56 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.56 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.24/0.56 % Starting new_bool_3 with 300s (1) cores
% 0.24/0.56 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.24/0.56 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.24/0.56 % Search class: FHUSS-FFSM22-SFFFFFNN
% 0.24/0.56 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.24/0.56 % Starting SubtermCWHack with 31s (1) cores
% 0.24/0.56 % SubtermCWHack with pid 2324238 completed with status 0
% 0.24/0.56 % Result found by SubtermCWHack
% 0.24/0.56 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.24/0.56 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.56 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.24/0.56 % Starting new_bool_3 with 300s (1) cores
% 0.24/0.56 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.24/0.56 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.24/0.56 % Search class: FHUSS-FFSM22-SFFFFFNN
% 0.24/0.56 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.24/0.56 % Starting SubtermCWHack with 31s (1) cores
% 0.24/0.56 % Preprocessing time : 0.002 s
% 0.24/0.56
% 0.24/0.56 % Proof found!
% 0.24/0.56 % SZS status Theorem
% 0.24/0.56 % SZS output start CNFRefutation
% See solution above
% 0.24/0.56 % Parsed axioms : 37
% 0.24/0.56 % Removed by relevancy pruning/SinE : 14
% 0.24/0.56 % Initial clauses : 38
% 0.24/0.56 % Removed in clause preprocessing : 2
% 0.24/0.56 % Initial clauses in saturation : 36
% 0.24/0.56 % Processed clauses : 54
% 0.24/0.56 % ...of these trivial : 3
% 0.24/0.56 % ...subsumed : 5
% 0.24/0.56 % ...remaining for further processing : 46
% 0.24/0.56 % Other redundant clauses eliminated : 0
% 0.24/0.56 % Clauses deleted for lack of memory : 0
% 0.24/0.56 % Backward-subsumed : 0
% 0.24/0.56 % Backward-rewritten : 6
% 0.24/0.56 % Generated clauses : 42
% 0.24/0.56 % ...of the previous two non-redundant : 24
% 0.24/0.56 % ...aggressively subsumed : 0
% 0.24/0.56 % Contextual simplify-reflections : 2
% 0.24/0.56 % Paramodulations : 42
% 0.24/0.56 % Factorizations : 0
% 0.24/0.56 % NegExts : 0
% 0.24/0.56 % Equation resolutions : 0
% 0.24/0.56 % Disequality decompositions : 0
% 0.24/0.56 % Total rewrite steps : 42
% 0.24/0.56 % ...of those cached : 22
% 0.24/0.56 % Propositional unsat checks : 0
% 0.24/0.56 % Propositional check models : 0
% 0.24/0.56 % Propositional check unsatisfiable : 0
% 0.24/0.56 % Propositional clauses : 0
% 0.24/0.56 % Propositional clauses after purity: 0
% 0.24/0.56 % Propositional unsat core size : 0
% 0.24/0.56 % Propositional preprocessing time : 0.000
% 0.24/0.56 % Propositional encoding time : 0.000
% 0.24/0.56 % Propositional solver time : 0.000
% 0.24/0.56 % Success case prop preproc time : 0.000
% 0.24/0.56 % Success case prop encoding time : 0.000
% 0.24/0.56 % Success case prop solver time : 0.000
% 0.24/0.56 % Current number of processed clauses : 40
% 0.24/0.56 % Positive orientable unit clauses : 21
% 0.24/0.56 % Positive unorientable unit clauses: 1
% 0.24/0.56 % Negative unit clauses : 5
% 0.24/0.56 % Non-unit-clauses : 13
% 0.24/0.56 % Current number of unprocessed clauses: 6
% 0.24/0.56 % ...number of literals in the above : 27
% 0.24/0.56 % Current number of archived formulas : 0
% 0.24/0.56 % Current number of archived clauses : 6
% 0.24/0.56 % Clause-clause subsumption calls (NU) : 12
% 0.24/0.56 % Rec. Clause-clause subsumption calls : 12
% 0.24/0.56 % Non-unit clause-clause subsumptions : 6
% 0.24/0.56 % Unit Clause-clause subsumption calls : 6
% 0.24/0.56 % Rewrite failures with RHS unbound : 0
% 0.24/0.56 % BW rewrite match attempts : 8
% 0.24/0.56 % BW rewrite match successes : 7
% 0.24/0.56 % Condensation attempts : 0
% 0.24/0.56 % Condensation successes : 0
% 0.24/0.56 % Termbank termtop insertions : 1963
% 0.24/0.56 % Search garbage collected termcells : 337
% 0.24/0.56
% 0.24/0.56 % -------------------------------------------------
% 0.24/0.56 % User time : 0.013 s
% 0.24/0.56 % System time : 0.001 s
% 0.24/0.56 % Total time : 0.014 s
% 0.24/0.56 % Maximum resident set size: 3656 pages
% 0.24/0.56
% 0.24/0.56 % -------------------------------------------------
% 0.24/0.56 % User time : 0.017 s
% 0.24/0.56 % System time : 0.006 s
% 0.24/0.56 % Total time : 0.023 s
% 0.24/0.56 % Maximum resident set size: 4864 pages
% 0.24/0.56 % E exiting
%------------------------------------------------------------------------------