%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : SET654+3 : TPTP v9.3.1. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n019.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:17:52 PM UTC 2026
% Result : Theorem 0.10s 0.47s
% Output : CNFRefutation 0.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 5
% Syntax : Number of formulae : 25 ( 8 unt; 0 def)
% Number of atoms : 91 ( 0 equ)
% Maximal formula atoms : 8 ( 3 avg)
% Number of connectives : 105 ( 39 ~; 36 |; 8 &)
% ( 0 <=>; 22 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 5 con; 0-2 aty)
% Number of variables : 53 ( 3 sgn 30 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(p3,axiom,
! [X1] :
( ilf_type(X1,set_type)
=> ! [X2] :
( ilf_type(X2,set_type)
=> ! [X3] :
( ilf_type(X3,set_type)
=> ! [X4] :
( ilf_type(X4,relation_type(X3,X1))
=> ( subset(range_of(X4),X2)
=> ilf_type(X4,relation_type(X3,X2)) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',p3) ).
fof(p22,axiom,
! [X1] : ilf_type(X1,set_type),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',p22) ).
fof(prove_relset_1_16,conjecture,
! [X1] :
( ilf_type(X1,set_type)
=> ! [X2] :
( ilf_type(X2,set_type)
=> ! [X3] :
( ilf_type(X3,set_type)
=> ! [X4] :
( ilf_type(X4,relation_type(X3,X1))
=> ( subset(X1,X2)
=> ilf_type(X4,relation_type(X3,X2)) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_relset_1_16) ).
fof(p1,axiom,
! [X1] :
( ilf_type(X1,set_type)
=> ! [X2] :
( ilf_type(X2,set_type)
=> ! [X3] :
( ilf_type(X3,set_type)
=> ( ( subset(X2,X3)
& subset(X1,X2) )
=> subset(X1,X3) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',p1) ).
fof(p2,axiom,
! [X1] :
( ilf_type(X1,set_type)
=> ! [X2] :
( ilf_type(X2,set_type)
=> ! [X3] :
( ilf_type(X3,relation_type(X1,X2))
=> ( subset(range_of(X3),X2)
& subset(domain_of(X3),X1) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',p2) ).
fof(c_0_5,plain,
! [X11,X12,X13,X14] :
( ilf_type(X14,relation_type(X13,X12))
| ~ subset(range_of(X14),X12)
| ~ ilf_type(X14,relation_type(X13,X11))
| ~ ilf_type(X13,set_type)
| ~ ilf_type(X12,set_type)
| ~ ilf_type(X11,set_type) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[p3])])])]) ).
fof(c_0_6,plain,
! [X60] : ilf_type(X60,set_type),
inference(variable_rename,[status(thm)],[p22]) ).
fof(c_0_7,negated_conjecture,
~ ! [X1] :
( ilf_type(X1,set_type)
=> ! [X2] :
( ilf_type(X2,set_type)
=> ! [X3] :
( ilf_type(X3,set_type)
=> ! [X4] :
( ilf_type(X4,relation_type(X3,X1))
=> ( subset(X1,X2)
=> ilf_type(X4,relation_type(X3,X2)) ) ) ) ) ),
inference(assume_negation,[status(cth)],[prove_relset_1_16]) ).
fof(c_0_8,plain,
! [X5,X6,X7] :
( subset(X5,X7)
| ~ subset(X6,X7)
| ~ subset(X5,X6)
| ~ ilf_type(X7,set_type)
| ~ ilf_type(X6,set_type)
| ~ ilf_type(X5,set_type) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[p1])])])]) ).
fof(c_0_9,plain,
! [X8,X9,X10] :
( ( ~ ilf_type(X8,set_type)
| ~ ilf_type(X9,set_type)
| ~ ilf_type(X10,relation_type(X8,X9))
| subset(range_of(X10),X9) )
& ( ~ ilf_type(X8,set_type)
| ~ ilf_type(X9,set_type)
| ~ ilf_type(X10,relation_type(X8,X9))
| subset(domain_of(X10),X8) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[p2])])])])]) ).
cnf(c_0_10,plain,
( ~ subset(range_of(X4),X2)
| ~ ilf_type(X4,relation_type(X3,X1))
| ~ ilf_type(X3,set_type)
| ~ ilf_type(X2,set_type)
| ~ ilf_type(X1,set_type)
| ilf_type(X4,relation_type(X3,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_11,plain,
ilf_type(X1,set_type),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
fof(c_0_12,negated_conjecture,
( ~ ilf_type(esk13_0,relation_type(esk12_0,esk11_0))
& subset(esk10_0,esk11_0)
& ilf_type(esk13_0,relation_type(esk12_0,esk10_0))
& ilf_type(esk12_0,set_type)
& ilf_type(esk11_0,set_type)
& ilf_type(esk10_0,set_type) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])])]) ).
cnf(c_0_13,plain,
( ~ subset(X2,X3)
| ~ subset(X1,X2)
| ~ ilf_type(X3,set_type)
| ~ ilf_type(X2,set_type)
| ~ ilf_type(X1,set_type)
| subset(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_14,plain,
( ~ ilf_type(X3,set_type)
| ~ ilf_type(X2,set_type)
| ~ ilf_type(X1,relation_type(X3,X2))
| subset(range_of(X1),X2) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_15,plain,
( ~ ilf_type(X1,relation_type(X2,X4))
| ~ subset(range_of(X1),X3)
| ilf_type(X1,relation_type(X2,X3)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_10,c_0_11]),c_0_11]),c_0_11])]) ).
cnf(c_0_16,negated_conjecture,
ilf_type(esk13_0,relation_type(esk12_0,esk10_0)),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_17,plain,
( ~ subset(X1,X3)
| ~ subset(X3,X2)
| subset(X1,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_13,c_0_11]),c_0_11]),c_0_11])]) ).
cnf(c_0_18,negated_conjecture,
subset(esk10_0,esk11_0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_19,plain,
( ~ ilf_type(X1,relation_type(X3,X2))
| subset(range_of(X1),X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_14,c_0_11]),c_0_11])]) ).
cnf(c_0_20,negated_conjecture,
( ~ subset(range_of(esk13_0),X1)
| ilf_type(esk13_0,relation_type(esk12_0,X1)) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_21,negated_conjecture,
( ~ subset(X1,esk10_0)
| subset(X1,esk11_0) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_22,negated_conjecture,
subset(range_of(esk13_0),esk10_0),
inference(spm,[status(thm)],[c_0_19,c_0_16]) ).
cnf(c_0_23,negated_conjecture,
~ ilf_type(esk13_0,relation_type(esk12_0,esk11_0)),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_24,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22])]),c_0_23]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET654+3 : TPTP v9.3.1. Released v2.2.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.37 % Computer : n019.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Mon Sep 21 05:31:34 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.38 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.42 Running first-order theorem proving
% 0.10/0.42 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.10/0.47 % Version: 3.5.1
% 0.10/0.47 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.10/0.47 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.47 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.10/0.47 % Starting new_bool_3 with 300s (1) cores
% 0.10/0.47 % Starting new_bool_1 with 300s (1) cores
% 0.10/0.47 % Starting sh5l with 300s (1) cores
% 0.10/0.47 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 1779630 completed with status 0
% 0.10/0.47 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.10/0.47 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.10/0.47 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.47 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.10/0.47 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.10/0.47 % No SInE strategy applied
% 0.10/0.47 % Search class: FGHSF-FFMS21-SFFFFFNN
% 0.10/0.47 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.10/0.47 % Starting SubtermCWHack with 136s (1) cores
% 0.10/0.47 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.10/0.47 % Starting 208_C09_12_F1_SE_CS_SP_PS_S070I with 136s (1) cores
% 0.10/0.47 % Starting G-E--_107_B42_F1_PI_SE_Q4_CS_SP_PS_S0Y with 136s (1) cores
% 0.10/0.47 % Starting new_bool_3 with 136s (1) cores
% 0.10/0.47 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 1779642 completed with status 0
% 0.10/0.47 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.10/0.47 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.10/0.47 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.47 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.10/0.47 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.10/0.47 % No SInE strategy applied
% 0.10/0.47 % Search class: FGHSF-FFMS21-SFFFFFNN
% 0.10/0.47 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.10/0.47 % Starting SubtermCWHack with 136s (1) cores
% 0.10/0.47 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.10/0.47 % Preprocessing time : 0.002 s
% 0.10/0.47 % Presaturation interreduction done
% 0.10/0.47
% 0.10/0.47 % Proof found!
% 0.10/0.47 % SZS status Theorem
% 0.10/0.47 % SZS output start CNFRefutation
% See solution above
% 0.10/0.47 % Parsed axioms : 23
% 0.10/0.47 % Removed by relevancy pruning/SinE : 0
% 0.10/0.47 % Initial clauses : 46
% 0.10/0.47 % Removed in clause preprocessing : 0
% 0.10/0.47 % Initial clauses in saturation : 46
% 0.10/0.47 % Processed clauses : 183
% 0.10/0.47 % ...of these trivial : 12
% 0.10/0.47 % ...subsumed : 35
% 0.10/0.47 % ...remaining for further processing : 136
% 0.10/0.47 % Other redundant clauses eliminated : 1
% 0.10/0.47 % Clauses deleted for lack of memory : 0
% 0.10/0.47 % Backward-subsumed : 0
% 0.10/0.47 % Backward-rewritten : 3
% 0.10/0.47 % Generated clauses : 244
% 0.10/0.47 % ...of the previous two non-redundant : 218
% 0.10/0.47 % ...aggressively subsumed : 0
% 0.10/0.47 % Contextual simplify-reflections : 1
% 0.10/0.47 % Paramodulations : 243
% 0.10/0.47 % Factorizations : 0
% 0.10/0.47 % NegExts : 0
% 0.10/0.47 % Equation resolutions : 1
% 0.10/0.47 % Disequality decompositions : 0
% 0.10/0.47 % Total rewrite steps : 96
% 0.10/0.47 % ...of those cached : 69
% 0.10/0.47 % Propositional unsat checks : 0
% 0.10/0.47 % Propositional check models : 0
% 0.10/0.47 % Propositional check unsatisfiable : 0
% 0.10/0.47 % Propositional clauses : 0
% 0.10/0.47 % Propositional clauses after purity: 0
% 0.10/0.47 % Propositional unsat core size : 0
% 0.10/0.47 % Propositional preprocessing time : 0.000
% 0.10/0.47 % Propositional encoding time : 0.000
% 0.10/0.47 % Propositional solver time : 0.000
% 0.10/0.47 % Success case prop preproc time : 0.000
% 0.10/0.47 % Success case prop encoding time : 0.000
% 0.10/0.47 % Success case prop solver time : 0.000
% 0.10/0.47 % Current number of processed clauses : 101
% 0.10/0.47 % Positive orientable unit clauses : 26
% 0.10/0.47 % Positive unorientable unit clauses: 0
% 0.10/0.47 % Negative unit clauses : 2
% 0.10/0.47 % Non-unit-clauses : 73
% 0.10/0.47 % Current number of unprocessed clauses: 113
% 0.10/0.47 % ...number of literals in the above : 218
% 0.10/0.47 % Current number of archived formulas : 0
% 0.10/0.47 % Current number of archived clauses : 35
% 0.10/0.47 % Clause-clause subsumption calls (NU) : 387
% 0.10/0.47 % Rec. Clause-clause subsumption calls : 310
% 0.10/0.47 % Non-unit clause-clause subsumptions : 33
% 0.10/0.47 % Unit Clause-clause subsumption calls : 70
% 0.10/0.47 % Rewrite failures with RHS unbound : 0
% 0.10/0.47 % BW rewrite match attempts : 15
% 0.10/0.47 % BW rewrite match successes : 3
% 0.10/0.47 % Condensation attempts : 0
% 0.10/0.47 % Condensation successes : 0
% 0.10/0.47 % Termbank termtop insertions : 7435
% 0.10/0.47 % Search garbage collected termcells : 975
% 0.10/0.47
% 0.10/0.47 % -------------------------------------------------
% 0.10/0.47 % User time : 0.019 s
% 0.10/0.47 % System time : 0.006 s
% 0.10/0.47 % Total time : 0.025 s
% 0.10/0.47 % Maximum resident set size: 3648 pages
% 0.10/0.47
% 0.10/0.47 % -------------------------------------------------
% 0.10/0.47 % User time : 0.065 s
% 0.10/0.47 % System time : 0.020 s
% 0.10/0.47 % Total time : 0.086 s
% 0.10/0.47 % Maximum resident set size: 4864 pages
% 0.10/0.47 % E exiting
%------------------------------------------------------------------------------