%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SET997+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 : n011.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:15:55 PM UTC 2026
% Result : Theorem 0.09s 0.46s
% Output : CNFRefutation 0.09s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 3
% Syntax : Number of formulae : 19 ( 4 unt; 0 def)
% Number of atoms : 93 ( 18 equ)
% Maximal formula atoms : 32 ( 4 avg)
% Number of connectives : 121 ( 47 ~; 46 |; 19 &)
% ( 3 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 18 ( 6 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 2 con; 0-3 aty)
% Number of variables : 42 ( 0 sgn 27 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
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(t19_funct_1,conjecture,
! [X1,X2] :
( ( function(X2)
& relation(X2) )
=> ( ! [X3] :
~ ( ! [X4] :
~ ( X3 = apply(X2,X4)
& in(X4,relation_dom(X2)) )
& in(X3,X1) )
=> subset(X1,relation_rng(X2)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t19_funct_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(c_0_3,plain,
! [X15,X16,X17,X19,X20,X21,X23] :
( ( ~ function(X15)
| ~ relation(X15)
| X21 = relation_rng(X15)
| in(esk3_2(X15,X21),X21)
| esk3_2(X15,X21) = apply(X15,esk4_2(X15,X21)) )
& ( ~ function(X15)
| ~ relation(X15)
| X21 = relation_rng(X15)
| in(esk3_2(X15,X21),X21)
| in(esk4_2(X15,X21),relation_dom(X15)) )
& ( ~ function(X15)
| ~ relation(X15)
| X21 = relation_rng(X15)
| esk3_2(X15,X21) != apply(X15,X23)
| ~ in(X23,relation_dom(X15))
| ~ in(esk3_2(X15,X21),X21) )
& ( ~ function(X15)
| ~ relation(X15)
| X16 != relation_rng(X15)
| in(X19,X16)
| X19 != apply(X15,X20)
| ~ in(X20,relation_dom(X15)) )
& ( ~ function(X15)
| ~ relation(X15)
| X16 != relation_rng(X15)
| ~ in(X17,X16)
| X17 = apply(X15,esk2_3(X15,X16,X17)) )
& ( ~ function(X15)
| ~ relation(X15)
| X16 != relation_rng(X15)
| ~ in(X17,X16)
| in(esk2_3(X15,X16,X17),relation_dom(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)],[d5_funct_1])])])])])])]) ).
fof(c_0_4,negated_conjecture,
~ ! [X1,X2] :
( ( function(X2)
& relation(X2) )
=> ( ! [X3] :
~ ( ! [X4] :
~ ( X3 = apply(X2,X4)
& in(X4,relation_dom(X2)) )
& in(X3,X1) )
=> subset(X1,relation_rng(X2)) ) ),
inference(assume_negation,[status(cth)],[t19_funct_1]) ).
cnf(c_0_5,plain,
( ~ function(X2)
| ~ relation(X2)
| X4 != relation_rng(X2)
| X3 != apply(X2,X1)
| ~ in(X1,relation_dom(X2))
| in(X3,X4) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
fof(c_0_6,negated_conjecture,
! [X45] :
( ~ subset(esk14_0,relation_rng(esk15_0))
& ( ~ in(X45,esk14_0)
| X45 = apply(esk15_0,esk16_1(X45)) )
& ( ~ in(X45,esk14_0)
| in(esk16_1(X45),relation_dom(esk15_0)) )
& function(esk15_0)
& relation(esk15_0) ),
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)],[c_0_4])])])])])]) ).
fof(c_0_7,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])])])])])])]) ).
cnf(c_0_8,plain,
( ~ in(X2,relation_dom(X1))
| ~ function(X1)
| ~ relation(X1)
| in(apply(X1,X2),relation_rng(X1)) ),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_5])]) ).
cnf(c_0_9,negated_conjecture,
( ~ in(X1,esk14_0)
| X1 = apply(esk15_0,esk16_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,negated_conjecture,
relation(esk15_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_11,negated_conjecture,
function(esk15_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_12,negated_conjecture,
( ~ in(X1,esk14_0)
| in(esk16_1(X1),relation_dom(esk15_0)) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_13,plain,
( ~ in(esk1_2(X1,X2),X2)
| subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_14,negated_conjecture,
( ~ in(X1,esk14_0)
| in(X1,relation_rng(esk15_0)) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_9]),c_0_10]),c_0_11])]),c_0_12]) ).
cnf(c_0_15,negated_conjecture,
( ~ in(esk1_2(X1,relation_rng(esk15_0)),esk14_0)
| subset(X1,relation_rng(esk15_0)) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_16,plain,
( subset(X1,X2)
| in(esk1_2(X1,X2),X1) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_17,negated_conjecture,
~ subset(esk14_0,relation_rng(esk15_0)),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_18,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET997+1 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.37 % Computer : n011.cluster.edu
% 0.09/0.37 % Model : x86_64 x86_64
% 0.09/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.37 % Memory : 8046.5625MB
% 0.09/0.37 % OS : Linux 6.8.0-71-generic
% 0.09/0.37 % CPULimit : 300
% 0.09/0.37 % WCLimit : 300
% 0.09/0.37 % DateTime : Mon Sep 21 05:46:10 UTC 2026
% 0.09/0.37 % CPUTime :
% 0.09/0.37 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.41 Running first-order theorem proving
% 0.09/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.09/0.46 % Version: 3.5.1
% 0.09/0.46 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.09/0.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.09/0.46 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.09/0.46 % Starting new_bool_3 with 300s (1) cores
% 0.09/0.46 % Starting new_bool_1 with 300s (1) cores
% 0.09/0.46 % Starting sh5l with 300s (1) cores
% 0.09/0.46 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 1098598 completed with status 0
% 0.09/0.46 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.09/0.46 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.09/0.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.09/0.46 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.09/0.46 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.09/0.46 % No SInE strategy applied
% 0.09/0.46 % Search class: FGHSM-FFMM31-SFFFFFNN
% 0.09/0.46 % Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 0.09/0.46 % Starting SubtermCWHack with 136s (1) cores
% 0.09/0.46 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.09/0.46 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S4b with 136s (1) cores
% 0.09/0.46 % Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S0Y with 136s (1) cores
% 0.09/0.46 % Starting G-E--_208_B07----D_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.09/0.46 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 1098606 completed with status 0
% 0.09/0.46 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.09/0.46 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.09/0.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.09/0.46 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.09/0.46 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.09/0.46 % No SInE strategy applied
% 0.09/0.46 % Search class: FGHSM-FFMM31-SFFFFFNN
% 0.09/0.46 % Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 0.09/0.46 % Starting SubtermCWHack with 136s (1) cores
% 0.09/0.46 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.09/0.46 % Preprocessing time : 0.002 s
% 0.09/0.46 % Presaturation interreduction done
% 0.09/0.46
% 0.09/0.46 % Proof found!
% 0.09/0.46 % SZS status Theorem
% 0.09/0.46 % SZS output start CNFRefutation
% See solution above
% 0.09/0.46 % Parsed axioms : 32
% 0.09/0.46 % Removed by relevancy pruning/SinE : 0
% 0.09/0.46 % Initial clauses : 55
% 0.09/0.46 % Removed in clause preprocessing : 0
% 0.09/0.46 % Initial clauses in saturation : 55
% 0.09/0.46 % Processed clauses : 146
% 0.09/0.46 % ...of these trivial : 3
% 0.09/0.46 % ...subsumed : 10
% 0.09/0.46 % ...remaining for further processing : 133
% 0.09/0.46 % Other redundant clauses eliminated : 4
% 0.09/0.46 % Clauses deleted for lack of memory : 0
% 0.09/0.46 % Backward-subsumed : 3
% 0.09/0.46 % Backward-rewritten : 4
% 0.09/0.46 % Generated clauses : 107
% 0.09/0.46 % ...of the previous two non-redundant : 90
% 0.09/0.46 % ...aggressively subsumed : 0
% 0.09/0.46 % Contextual simplify-reflections : 1
% 0.09/0.46 % Paramodulations : 104
% 0.09/0.46 % Factorizations : 0
% 0.09/0.46 % NegExts : 0
% 0.09/0.46 % Equation resolutions : 4
% 0.09/0.46 % Disequality decompositions : 0
% 0.09/0.46 % Total rewrite steps : 29
% 0.09/0.46 % ...of those cached : 18
% 0.09/0.46 % Propositional unsat checks : 0
% 0.09/0.46 % Propositional check models : 0
% 0.09/0.46 % Propositional check unsatisfiable : 0
% 0.09/0.46 % Propositional clauses : 0
% 0.09/0.46 % Propositional clauses after purity: 0
% 0.09/0.46 % Propositional unsat core size : 0
% 0.09/0.46 % Propositional preprocessing time : 0.000
% 0.09/0.46 % Propositional encoding time : 0.000
% 0.09/0.46 % Propositional solver time : 0.000
% 0.09/0.46 % Success case prop preproc time : 0.000
% 0.09/0.46 % Success case prop encoding time : 0.000
% 0.09/0.46 % Success case prop solver time : 0.000
% 0.09/0.46 % Current number of processed clauses : 71
% 0.09/0.46 % Positive orientable unit clauses : 19
% 0.09/0.46 % Positive unorientable unit clauses: 0
% 0.09/0.46 % Negative unit clauses : 8
% 0.09/0.46 % Non-unit-clauses : 44
% 0.09/0.46 % Current number of unprocessed clauses: 49
% 0.09/0.46 % ...number of literals in the above : 169
% 0.09/0.46 % Current number of archived formulas : 0
% 0.09/0.46 % Current number of archived clauses : 59
% 0.09/0.46 % Clause-clause subsumption calls (NU) : 336
% 0.09/0.46 % Rec. Clause-clause subsumption calls : 225
% 0.09/0.46 % Non-unit clause-clause subsumptions : 5
% 0.09/0.46 % Unit Clause-clause subsumption calls : 84
% 0.09/0.46 % Rewrite failures with RHS unbound : 0
% 0.09/0.46 % BW rewrite match attempts : 5
% 0.09/0.46 % BW rewrite match successes : 3
% 0.09/0.46 % Condensation attempts : 0
% 0.09/0.46 % Condensation successes : 0
% 0.09/0.46 % Termbank termtop insertions : 4532
% 0.09/0.46 % Search garbage collected termcells : 637
% 0.09/0.46
% 0.09/0.46 % -------------------------------------------------
% 0.09/0.46 % User time : 0.017 s
% 0.09/0.46 % System time : 0.002 s
% 0.09/0.46 % Total time : 0.019 s
% 0.09/0.46 % Maximum resident set size: 3604 pages
% 0.09/0.46
% 0.09/0.46 % -------------------------------------------------
% 0.09/0.46 % User time : 0.080 s
% 0.09/0.46 % System time : 0.015 s
% 0.09/0.46 % Total time : 0.095 s
% 0.09/0.46 % Maximum resident set size: 4864 pages
% 0.09/0.46 % E exiting
%------------------------------------------------------------------------------