%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : SEU047+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 : 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:28:00 PM UTC 2026
% Result : Theorem 0.11s 0.44s
% Output : CNFRefutation 0.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 3
% Syntax : Number of formulae : 16 ( 4 unt; 0 def)
% Number of atoms : 43 ( 17 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 43 ( 16 ~; 12 |; 7 &)
% ( 0 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 26 ( 0 sgn 18 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t97_funct_1,conjecture,
! [X1,X2,X3] :
( ( function(X3)
& relation(X3) )
=> ( subset(X1,X2)
=> ( relation_rng_restriction(X1,relation_rng_restriction(X2,X3)) = relation_rng_restriction(X1,X3)
& relation_rng_restriction(X2,relation_rng_restriction(X1,X3)) = relation_rng_restriction(X1,X3) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t97_funct_1) ).
fof(t129_relat_1,axiom,
! [X1,X2,X3] :
( relation(X3)
=> ( subset(X1,X2)
=> relation_rng_restriction(X2,relation_rng_restriction(X1,X3)) = relation_rng_restriction(X1,X3) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t129_relat_1) ).
fof(t130_relat_1,axiom,
! [X1,X2,X3] :
( relation(X3)
=> ( subset(X1,X2)
=> relation_rng_restriction(X1,relation_rng_restriction(X2,X3)) = relation_rng_restriction(X1,X3) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t130_relat_1) ).
fof(c_0_3,negated_conjecture,
~ ! [X1,X2,X3] :
( ( function(X3)
& relation(X3) )
=> ( subset(X1,X2)
=> ( relation_rng_restriction(X1,relation_rng_restriction(X2,X3)) = relation_rng_restriction(X1,X3)
& relation_rng_restriction(X2,relation_rng_restriction(X1,X3)) = relation_rng_restriction(X1,X3) ) ) ),
inference(assume_negation,[status(cth)],[t97_funct_1]) ).
fof(c_0_4,plain,
! [X11,X12,X13] :
( relation_rng_restriction(X12,relation_rng_restriction(X11,X13)) = relation_rng_restriction(X11,X13)
| ~ subset(X11,X12)
| ~ relation(X13) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t129_relat_1])])]) ).
fof(c_0_5,negated_conjecture,
( ( relation_rng_restriction(esk1_0,relation_rng_restriction(esk2_0,esk3_0)) != relation_rng_restriction(esk1_0,esk3_0)
| relation_rng_restriction(esk2_0,relation_rng_restriction(esk1_0,esk3_0)) != relation_rng_restriction(esk1_0,esk3_0) )
& subset(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_3])])])]) ).
cnf(c_0_6,plain,
( ~ subset(X2,X3)
| ~ relation(X1)
| relation_rng_restriction(X3,relation_rng_restriction(X2,X1)) = relation_rng_restriction(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,negated_conjecture,
subset(esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
fof(c_0_8,plain,
! [X14,X15,X16] :
( relation_rng_restriction(X14,relation_rng_restriction(X15,X16)) = relation_rng_restriction(X14,X16)
| ~ subset(X14,X15)
| ~ relation(X16) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t130_relat_1])])]) ).
cnf(c_0_9,negated_conjecture,
( relation_rng_restriction(esk1_0,relation_rng_restriction(esk2_0,esk3_0)) != relation_rng_restriction(esk1_0,esk3_0)
| relation_rng_restriction(esk2_0,relation_rng_restriction(esk1_0,esk3_0)) != relation_rng_restriction(esk1_0,esk3_0) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_10,negated_conjecture,
( ~ relation(X1)
| relation_rng_restriction(esk2_0,relation_rng_restriction(esk1_0,X1)) = relation_rng_restriction(esk1_0,X1) ),
inference(spm,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_11,negated_conjecture,
relation(esk3_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_12,plain,
( ~ subset(X2,X3)
| ~ relation(X1)
| relation_rng_restriction(X2,relation_rng_restriction(X3,X1)) = relation_rng_restriction(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,negated_conjecture,
relation_rng_restriction(esk1_0,relation_rng_restriction(esk2_0,esk3_0)) != relation_rng_restriction(esk1_0,esk3_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_11])]) ).
cnf(c_0_14,negated_conjecture,
( ~ relation(X1)
| relation_rng_restriction(esk1_0,relation_rng_restriction(esk2_0,X1)) = relation_rng_restriction(esk1_0,X1) ),
inference(spm,[status(thm)],[c_0_12,c_0_7]) ).
cnf(c_0_15,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_11])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU047+1 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.37 % Computer : n020.cluster.edu
% 0.11/0.37 % Model : x86_64 x86_64
% 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37 % Memory : 8046.5625MB
% 0.11/0.37 % OS : Linux 6.8.0-71-generic
% 0.11/0.37 % CPULimit : 300
% 0.11/0.37 % WCLimit : 300
% 0.11/0.37 % DateTime : Mon Sep 21 05:48:49 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.37 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.41 Running first-order theorem proving
% 0.11/0.41 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.11/0.44 % Version: 3.5.1
% 0.11/0.44 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.11/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.11/0.44 % Starting new_bool_3 with 300s (1) cores
% 0.11/0.44 % Starting new_bool_1 with 300s (1) cores
% 0.11/0.44 % Starting sh5l with 300s (1) cores
% 0.11/0.44 % new_bool_3 with pid 2136382 completed with status 0
% 0.11/0.44 % Result found by new_bool_3
% 0.11/0.44 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.11/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.11/0.44 % Starting new_bool_3 with 300s (1) cores
% 0.11/0.44 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.11/0.44 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.11/0.44 % Search class: FGHSM-FFMM21-SFFFFFNN
% 0.11/0.44 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.11/0.44 % Starting SubtermCWHack with 28s (1) cores
% 0.11/0.44 % SubtermCWHack with pid 2136385 completed with status 0
% 0.11/0.44 % Result found by SubtermCWHack
% 0.11/0.44 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.11/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.11/0.44 % Starting new_bool_3 with 300s (1) cores
% 0.11/0.44 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.11/0.44 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.11/0.44 % Search class: FGHSM-FFMM21-SFFFFFNN
% 0.11/0.44 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.11/0.44 % Starting SubtermCWHack with 28s (1) cores
% 0.11/0.44 % Preprocessing time : 0.002 s
% 0.11/0.44
% 0.11/0.44 % Proof found!
% 0.11/0.44 % SZS status Theorem
% 0.11/0.44 % SZS output start CNFRefutation
% See solution above
% 0.11/0.44 % Parsed axioms : 33
% 0.11/0.44 % Removed by relevancy pruning/SinE : 7
% 0.11/0.44 % Initial clauses : 38
% 0.11/0.44 % Removed in clause preprocessing : 0
% 0.11/0.44 % Initial clauses in saturation : 38
% 0.11/0.44 % Processed clauses : 92
% 0.11/0.44 % ...of these trivial : 0
% 0.11/0.44 % ...subsumed : 14
% 0.11/0.44 % ...remaining for further processing : 78
% 0.11/0.44 % Other redundant clauses eliminated : 0
% 0.11/0.44 % Clauses deleted for lack of memory : 0
% 0.11/0.44 % Backward-subsumed : 3
% 0.11/0.44 % Backward-rewritten : 8
% 0.11/0.44 % Generated clauses : 98
% 0.11/0.44 % ...of the previous two non-redundant : 83
% 0.11/0.44 % ...aggressively subsumed : 0
% 0.11/0.44 % Contextual simplify-reflections : 2
% 0.11/0.44 % Paramodulations : 98
% 0.11/0.44 % Factorizations : 0
% 0.11/0.44 % NegExts : 0
% 0.11/0.44 % Equation resolutions : 0
% 0.11/0.44 % Disequality decompositions : 0
% 0.11/0.44 % Total rewrite steps : 22
% 0.11/0.44 % ...of those cached : 13
% 0.11/0.44 % Propositional unsat checks : 0
% 0.11/0.44 % Propositional check models : 0
% 0.11/0.44 % Propositional check unsatisfiable : 0
% 0.11/0.44 % Propositional clauses : 0
% 0.11/0.44 % Propositional clauses after purity: 0
% 0.11/0.44 % Propositional unsat core size : 0
% 0.11/0.44 % Propositional preprocessing time : 0.000
% 0.11/0.44 % Propositional encoding time : 0.000
% 0.11/0.44 % Propositional solver time : 0.000
% 0.11/0.44 % Success case prop preproc time : 0.000
% 0.11/0.44 % Success case prop encoding time : 0.000
% 0.11/0.44 % Success case prop solver time : 0.000
% 0.11/0.44 % Current number of processed clauses : 67
% 0.11/0.44 % Positive orientable unit clauses : 17
% 0.11/0.44 % Positive unorientable unit clauses: 0
% 0.11/0.44 % Negative unit clauses : 5
% 0.11/0.44 % Non-unit-clauses : 45
% 0.11/0.44 % Current number of unprocessed clauses: 20
% 0.11/0.44 % ...number of literals in the above : 61
% 0.11/0.44 % Current number of archived formulas : 0
% 0.11/0.44 % Current number of archived clauses : 11
% 0.11/0.44 % Clause-clause subsumption calls (NU) : 263
% 0.11/0.44 % Rec. Clause-clause subsumption calls : 207
% 0.11/0.44 % Non-unit clause-clause subsumptions : 18
% 0.11/0.44 % Unit Clause-clause subsumption calls : 31
% 0.11/0.44 % Rewrite failures with RHS unbound : 0
% 0.11/0.44 % BW rewrite match attempts : 4
% 0.11/0.44 % BW rewrite match successes : 3
% 0.11/0.44 % Condensation attempts : 0
% 0.11/0.44 % Condensation successes : 0
% 0.11/0.44 % Termbank termtop insertions : 3318
% 0.11/0.44 % Search garbage collected termcells : 373
% 0.11/0.44
% 0.11/0.44 % -------------------------------------------------
% 0.11/0.44 % User time : 0.008 s
% 0.11/0.44 % System time : 0.002 s
% 0.11/0.44 % Total time : 0.010 s
% 0.11/0.44 % Maximum resident set size: 3656 pages
% 0.11/0.44
% 0.11/0.44 % -------------------------------------------------
% 0.11/0.44 % User time : 0.009 s
% 0.11/0.44 % System time : 0.007 s
% 0.11/0.44 % Total time : 0.016 s
% 0.11/0.44 % Maximum resident set size: 4608 pages
% 0.11/0.44 % E exiting
%------------------------------------------------------------------------------