%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SEU075+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 : 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:46 PM UTC 2026
% Result : Theorem 218.69s 33.32s
% Output : CNFRefutation 218.69s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 4
% Syntax : Number of formulae : 37 ( 17 unt; 0 def)
% Number of atoms : 172 ( 59 equ)
% Maximal formula atoms : 32 ( 4 avg)
% Number of connectives : 213 ( 78 ~; 82 |; 35 &)
% ( 2 <=>; 16 =>; 0 <=; 0 <~>)
% Maximal formula depth : 18 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 4 con; 0-3 aty)
% Number of variables : 51 ( 0 sgn 29 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t156_funct_1,conjecture,
! [X1,X2] :
( ( function(X2)
& relation(X2) )
=> ! [X3] :
( ( function(X3)
& relation(X3) )
=> ! [X4] :
( ( function(X4)
& relation(X4) )
=> ( ( relation_composition(X2,X3) = relation_composition(X2,X4)
& relation_dom(X4) = X1
& relation_dom(X3) = X1
& X1 = relation_rng(X2) )
=> X3 = X4 ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t156_funct_1) ).
fof(d5_funct_1,axiom,
! [X1] :
( ( function(X1)
& relation(X1) )
=> ! [X2] :
( X2 = relation_rng(X1)
<=> ! [X3] :
( in(X3,X2)
<=> ? [X4] :
( X3 = apply(X1,X4)
& in(X4,relation_dom(X1)) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d5_funct_1) ).
fof(t9_funct_1,axiom,
! [X1] :
( ( function(X1)
& relation(X1) )
=> ! [X2] :
( ( function(X2)
& relation(X2) )
=> ( ( ! [X3] :
( in(X3,relation_dom(X1))
=> apply(X1,X3) = apply(X2,X3) )
& relation_dom(X1) = relation_dom(X2) )
=> X1 = X2 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t9_funct_1) ).
fof(t23_funct_1,axiom,
! [X1,X2] :
( ( function(X2)
& relation(X2) )
=> ! [X3] :
( ( function(X3)
& relation(X3) )
=> ( in(X1,relation_dom(X2))
=> apply(relation_composition(X2,X3),X1) = apply(X3,apply(X2,X1)) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t23_funct_1) ).
fof(c_0_4,negated_conjecture,
~ ! [X1,X2] :
( ( function(X2)
& relation(X2) )
=> ! [X3] :
( ( function(X3)
& relation(X3) )
=> ! [X4] :
( ( function(X4)
& relation(X4) )
=> ( ( relation_composition(X2,X3) = relation_composition(X2,X4)
& relation_dom(X4) = X1
& relation_dom(X3) = X1
& X1 = relation_rng(X2) )
=> X3 = X4 ) ) ) ),
inference(assume_negation,[status(cth)],[t156_funct_1]) ).
fof(c_0_5,plain,
! [X19,X20,X21,X23,X24,X25,X27] :
( ( ~ function(X19)
| ~ relation(X19)
| X25 = relation_rng(X19)
| in(esk6_2(X19,X25),X25)
| esk6_2(X19,X25) = apply(X19,esk7_2(X19,X25)) )
& ( ~ function(X19)
| ~ relation(X19)
| X25 = relation_rng(X19)
| in(esk6_2(X19,X25),X25)
| in(esk7_2(X19,X25),relation_dom(X19)) )
& ( ~ function(X19)
| ~ relation(X19)
| X25 = relation_rng(X19)
| esk6_2(X19,X25) != apply(X19,X27)
| ~ in(X27,relation_dom(X19))
| ~ in(esk6_2(X19,X25),X25) )
& ( ~ function(X19)
| ~ relation(X19)
| X20 != relation_rng(X19)
| in(X23,X20)
| X23 != apply(X19,X24)
| ~ in(X24,relation_dom(X19)) )
& ( ~ function(X19)
| ~ relation(X19)
| X20 != relation_rng(X19)
| ~ in(X21,X20)
| X21 = apply(X19,esk5_3(X19,X20,X21)) )
& ( ~ function(X19)
| ~ relation(X19)
| X20 != relation_rng(X19)
| ~ in(X21,X20)
| in(esk5_3(X19,X20,X21),relation_dom(X19)) ) ),
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)],[d5_funct_1])])])])])])]) ).
fof(c_0_6,plain,
! [X44,X45] :
( ( ~ function(X44)
| ~ relation(X44)
| ~ function(X45)
| ~ relation(X45)
| X44 = X45
| relation_dom(X44) != relation_dom(X45)
| apply(X44,esk14_2(X44,X45)) != apply(X45,esk14_2(X44,X45)) )
& ( ~ function(X44)
| ~ relation(X44)
| ~ function(X45)
| ~ relation(X45)
| X44 = X45
| relation_dom(X44) != relation_dom(X45)
| in(esk14_2(X44,X45),relation_dom(X44)) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t9_funct_1])])])])])]) ).
fof(c_0_7,negated_conjecture,
( esk3_0 != esk4_0
& relation_composition(esk2_0,esk3_0) = relation_composition(esk2_0,esk4_0)
& relation_dom(esk4_0) = esk1_0
& relation_dom(esk3_0) = esk1_0
& esk1_0 = relation_rng(esk2_0)
& function(esk4_0)
& relation(esk4_0)
& function(esk3_0)
& relation(esk3_0)
& function(esk2_0)
& relation(esk2_0) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])])]) ).
cnf(c_0_8,plain,
( ~ function(X1)
| ~ relation(X1)
| X2 != relation_rng(X1)
| ~ in(X3,X2)
| in(esk5_3(X1,X2,X3),relation_dom(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,plain,
( ~ function(X1)
| ~ relation(X1)
| ~ function(X2)
| ~ relation(X2)
| relation_dom(X1) != relation_dom(X2)
| X1 = X2
| in(esk14_2(X1,X2),relation_dom(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,negated_conjecture,
relation_dom(esk4_0) = esk1_0,
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_11,negated_conjecture,
relation(esk4_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_12,negated_conjecture,
function(esk4_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_13,plain,
( ~ function(X2)
| ~ relation(X2)
| X3 != relation_rng(X2)
| ~ in(X1,X3)
| X1 = apply(X2,esk5_3(X2,X3,X1)) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_14,plain,
( ~ in(X2,relation_rng(X1))
| ~ function(X1)
| ~ relation(X1)
| in(esk5_3(X1,relation_rng(X1),X2),relation_dom(X1)) ),
inference(er,[status(thm)],[c_0_8]) ).
cnf(c_0_15,negated_conjecture,
esk1_0 = relation_rng(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_16,negated_conjecture,
relation(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_17,negated_conjecture,
function(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_18,negated_conjecture,
( ~ function(X1)
| ~ relation(X1)
| relation_dom(X1) != esk1_0
| in(esk14_2(esk4_0,X1),esk1_0)
| esk4_0 = X1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_11]),c_0_12])]) ).
cnf(c_0_19,negated_conjecture,
relation_dom(esk3_0) = esk1_0,
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_20,negated_conjecture,
relation(esk3_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_21,negated_conjecture,
function(esk3_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_22,negated_conjecture,
esk3_0 != esk4_0,
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_23,plain,
( ~ in(X2,relation_rng(X1))
| ~ function(X1)
| ~ relation(X1)
| apply(X1,esk5_3(X1,relation_rng(X1),X2)) = X2 ),
inference(er,[status(thm)],[c_0_13]) ).
fof(c_0_24,plain,
! [X41,X42,X43] :
( apply(relation_composition(X42,X43),X41) = apply(X43,apply(X42,X41))
| ~ in(X41,relation_dom(X42))
| ~ function(X43)
| ~ relation(X43)
| ~ function(X42)
| ~ relation(X42) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t23_funct_1])])])]) ).
cnf(c_0_25,negated_conjecture,
( ~ in(X1,esk1_0)
| in(esk5_3(esk2_0,esk1_0,X1),relation_dom(esk2_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16]),c_0_17])]) ).
cnf(c_0_26,negated_conjecture,
in(esk14_2(esk4_0,esk3_0),esk1_0),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20]),c_0_21])]),c_0_22]) ).
cnf(c_0_27,negated_conjecture,
( ~ in(X1,esk1_0)
| apply(esk2_0,esk5_3(esk2_0,esk1_0,X1)) = X1 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_15]),c_0_16]),c_0_17])]) ).
cnf(c_0_28,plain,
( ~ in(X3,relation_dom(X1))
| ~ function(X2)
| ~ relation(X2)
| ~ function(X1)
| ~ relation(X1)
| apply(relation_composition(X1,X2),X3) = apply(X2,apply(X1,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_29,negated_conjecture,
in(esk5_3(esk2_0,esk1_0,esk14_2(esk4_0,esk3_0)),relation_dom(esk2_0)),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_30,negated_conjecture,
apply(esk2_0,esk5_3(esk2_0,esk1_0,esk14_2(esk4_0,esk3_0))) = esk14_2(esk4_0,esk3_0),
inference(spm,[status(thm)],[c_0_27,c_0_26]) ).
cnf(c_0_31,negated_conjecture,
( ~ function(X1)
| ~ relation(X1)
| apply(relation_composition(esk2_0,X1),esk5_3(esk2_0,esk1_0,esk14_2(esk4_0,esk3_0))) = apply(X1,esk14_2(esk4_0,esk3_0)) ),
inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_16]),c_0_17])]),c_0_30]) ).
cnf(c_0_32,negated_conjecture,
relation_composition(esk2_0,esk3_0) = relation_composition(esk2_0,esk4_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_33,negated_conjecture,
apply(relation_composition(esk2_0,esk3_0),esk5_3(esk2_0,esk1_0,esk14_2(esk4_0,esk3_0))) = apply(esk4_0,esk14_2(esk4_0,esk3_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_11]),c_0_12])]) ).
cnf(c_0_34,plain,
( ~ function(X1)
| ~ relation(X1)
| ~ function(X2)
| ~ relation(X2)
| relation_dom(X1) != relation_dom(X2)
| apply(X1,esk14_2(X1,X2)) != apply(X2,esk14_2(X1,X2))
| X1 = X2 ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_35,negated_conjecture,
apply(esk4_0,esk14_2(esk4_0,esk3_0)) = apply(esk3_0,esk14_2(esk4_0,esk3_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_33]),c_0_20]),c_0_21])]) ).
cnf(c_0_36,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_10]),c_0_19]),c_0_20]),c_0_11]),c_0_21]),c_0_12])]),c_0_22]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU075+1 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.06 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.19/0.43 % Computer : n026.cluster.edu
% 0.19/0.43 % Model : x86_64 x86_64
% 0.19/0.43 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.19/0.43 % Memory : 8046.5625MB
% 0.19/0.43 % OS : Linux 6.8.0-71-generic
% 0.19/0.43 % CPULimit : 300
% 0.19/0.43 % WCLimit : 300
% 0.19/0.43 % DateTime : Mon Sep 21 05:52:06 UTC 2026
% 0.19/0.44 % CPUTime :
% 0.19/0.44 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.19/0.54 Running first-order theorem proving
% 0.19/0.54 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
% 218.69/33.32 % Version: 3.5.1
% 218.69/33.32 % Preprocessing class: FSMSSMSSSSSNFFN.
% 218.69/33.32 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 218.69/33.32 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 218.69/33.32 % Starting new_bool_3 with 300s (1) cores
% 218.69/33.32 % Starting new_bool_1 with 300s (1) cores
% 218.69/33.32 % Starting sh5l with 300s (1) cores
% 218.69/33.32 % new_bool_1 with pid 1499095 completed with status 0
% 218.69/33.32 % Result found by new_bool_1
% 218.69/33.32 % Preprocessing class: FSMSSMSSSSSNFFN.
% 218.69/33.32 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 218.69/33.32 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 218.69/33.32 % Starting new_bool_3 with 300s (1) cores
% 218.69/33.32 % Starting new_bool_1 with 300s (1) cores
% 218.69/33.32 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 218.69/33.32 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 218.69/33.32 % Search class: FGHSS-FFMM31-SFFFFFNN
% 218.69/33.32 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 218.69/33.32 % Starting SubtermCWHack with 28s (1) cores
% 218.69/33.32 % SubtermCWHack with pid 1499104 completed with status 8
% 218.69/33.32 % Starting new_bool_1 with 31s (1) cores
% 218.69/33.32 % new_bool_1 with pid 1499673 completed with status 0
% 218.69/33.32 % Result found by new_bool_1
% 218.69/33.32 % Preprocessing class: FSMSSMSSSSSNFFN.
% 218.69/33.32 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 218.69/33.32 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 218.69/33.32 % Starting new_bool_3 with 300s (1) cores
% 218.69/33.32 % Starting new_bool_1 with 300s (1) cores
% 218.69/33.32 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 218.69/33.32 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 218.69/33.32 % Search class: FGHSS-FFMM31-SFFFFFNN
% 218.69/33.32 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 218.69/33.32 % Starting SubtermCWHack with 28s (1) cores
% 218.69/33.32 % SubtermCWHack with pid 1499104 completed with status 8
% 218.69/33.32 % Starting new_bool_1 with 31s (1) cores
% 218.69/33.32 % Preprocessing time : 0.001 s
% 218.69/33.32 % Presaturation interreduction done
% 218.69/33.32
% 218.69/33.32 % Proof found!
% 218.69/33.32 % SZS status Theorem
% 218.69/33.32 % SZS output start CNFRefutation
% See solution above
% 218.69/33.32 % Parsed axioms : 40
% 218.69/33.32 % Removed by relevancy pruning/SinE : 9
% 218.69/33.32 % Initial clauses : 59
% 218.69/33.32 % Removed in clause preprocessing : 0
% 218.69/33.32 % Initial clauses in saturation : 59
% 218.69/33.32 % Processed clauses : 7085
% 218.69/33.32 % ...of these trivial : 16
% 218.69/33.32 % ...subsumed : 5463
% 218.69/33.32 % ...remaining for further processing : 1606
% 218.69/33.32 % Other redundant clauses eliminated : 337
% 218.69/33.32 % Clauses deleted for lack of memory : 0
% 218.69/33.32 % Backward-subsumed : 73
% 218.69/33.32 % Backward-rewritten : 72
% 218.69/33.32 % Generated clauses : 33549
% 218.69/33.32 % ...of the previous two non-redundant : 33050
% 218.69/33.32 % ...aggressively subsumed : 0
% 218.69/33.32 % Contextual simplify-reflections : 41
% 218.69/33.32 % Paramodulations : 33193
% 218.69/33.32 % Factorizations : 0
% 218.69/33.32 % NegExts : 0
% 218.69/33.32 % Equation resolutions : 350
% 218.69/33.32 % Disequality decompositions : 0
% 218.69/33.32 % Total rewrite steps : 3896
% 218.69/33.32 % ...of those cached : 3801
% 218.69/33.32 % Propositional unsat checks : 0
% 218.69/33.32 % Propositional check models : 0
% 218.69/33.32 % Propositional check unsatisfiable : 0
% 218.69/33.32 % Propositional clauses : 0
% 218.69/33.32 % Propositional clauses after purity: 0
% 218.69/33.32 % Propositional unsat core size : 0
% 218.69/33.32 % Propositional preprocessing time : 0.000
% 218.69/33.32 % Propositional encoding time : 0.000
% 218.69/33.32 % Propositional solver time : 0.000
% 218.69/33.32 % Success case prop preproc time : 0.000
% 218.69/33.32 % Success case prop encoding time : 0.000
% 218.69/33.32 % Success case prop solver time : 0.000
% 218.69/33.32 % Current number of processed clauses : 1393
% 218.69/33.32 % Positive orientable unit clauses : 117
% 218.69/33.32 % Positive unorientable unit clauses: 0
% 218.69/33.32 % Negative unit clauses : 55
% 218.69/33.32 % Non-unit-clauses : 1221
% 218.69/33.32 % Current number of unprocessed clauses: 25682
% 218.69/33.32 % ...number of literals in the above : 149142
% 218.69/33.32 % Current number of archived formulas : 0
% 218.69/33.32 % Current number of archived clauses : 210
% 218.69/33.32 % Clause-clause subsumption calls (NU) : 270512
% 218.69/33.32 % Rec. Clause-clause subsumption calls : 116217
% 218.69/33.32 % Non-unit clause-clause subsumptions : 2794
% 218.69/33.32 % Unit Clause-clause subsumption calls : 3979
% 218.69/33.32 % Rewrite failures with RHS unbound : 0
% 218.69/33.32 % BW rewrite match attempts : 251
% 218.69/33.32 % BW rewrite match successes : 8
% 218.69/33.32 % Condensation attempts : 0
% 218.69/33.32 % Condensation successes : 0
% 218.69/33.32 % Termbank termtop insertions : 554387
% 218.69/33.32 % Search garbage collected termcells : 839
% 218.69/33.32
% 218.69/33.32 % -------------------------------------------------
% 218.69/33.32 % User time : 27.679 s
% 218.69/33.32 % System time : 0.834 s
% 218.69/33.32 % Total time : 28.513 s
% 218.69/33.32 % Maximum resident set size: 3668 pages
% 218.69/33.32
% 218.69/33.32 % -------------------------------------------------
% 218.69/33.32 % User time : 27.682 s
% 218.69/33.32 % System time : 0.843 s
% 218.69/33.32 % Total time : 28.525 s
% 218.69/33.32 % Maximum resident set size: 4864 pages
% 218.69/33.32 % E exiting
%------------------------------------------------------------------------------