%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SEU264+2 : TPTP v9.3.1. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n018.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:24:30 PM UTC 2026
% Result : Theorem 2.90s 0.90s
% Output : CNFRefutation 2.90s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 5
% Syntax : Number of formulae : 25 ( 9 unt; 0 def)
% Number of atoms : 54 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 48 ( 19 ~; 16 |; 5 &)
% ( 0 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-1 aty)
% Number of variables : 48 ( 4 sgn 31 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t16_relset_1,conjecture,
! [X1,X2,X3,X4] :
( relation_of2_as_subset(X4,X3,X1)
=> ( subset(X1,X2)
=> relation_of2_as_subset(X4,X3,X2) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t16_relset_1) ).
fof(t1_xboole_1,lemma,
! [X1,X2,X3] :
( ( subset(X2,X3)
& subset(X1,X2) )
=> subset(X1,X3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t1_xboole_1) ).
fof(t12_relset_1,lemma,
! [X1,X2,X3] :
( relation_of2_as_subset(X3,X1,X2)
=> ( subset(relation_rng(X3),X2)
& subset(relation_dom(X3),X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t12_relset_1) ).
fof(reflexivity_r1_tarski,axiom,
! [X1,X2] : subset(X1,X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',reflexivity_r1_tarski) ).
fof(t14_relset_1,lemma,
! [X1,X2,X3,X4] :
( relation_of2_as_subset(X4,X3,X1)
=> ( subset(relation_rng(X4),X2)
=> relation_of2_as_subset(X4,X3,X2) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t14_relset_1) ).
fof(c_0_5,negated_conjecture,
~ ! [X1,X2,X3,X4] :
( relation_of2_as_subset(X4,X3,X1)
=> ( subset(X1,X2)
=> relation_of2_as_subset(X4,X3,X2) ) ),
inference(assume_negation,[status(cth)],[t16_relset_1]) ).
fof(c_0_6,lemma,
! [X658,X659,X660] :
( subset(X658,X660)
| ~ subset(X659,X660)
| ~ subset(X658,X659) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t1_xboole_1])])]) ).
fof(c_0_7,negated_conjecture,
( ~ relation_of2_as_subset(esk112_0,esk111_0,esk110_0)
& subset(esk109_0,esk110_0)
& relation_of2_as_subset(esk112_0,esk111_0,esk109_0) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])])]) ).
cnf(c_0_8,lemma,
( ~ subset(X2,X3)
| ~ subset(X1,X2)
| subset(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_9,negated_conjecture,
subset(esk109_0,esk110_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
fof(c_0_10,lemma,
! [X588,X589,X590] :
( ( ~ relation_of2_as_subset(X590,X588,X589)
| subset(relation_rng(X590),X589) )
& ( ~ relation_of2_as_subset(X590,X588,X589)
| subset(relation_dom(X590),X588) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t12_relset_1])])])]) ).
cnf(c_0_11,negated_conjecture,
( ~ subset(X1,esk109_0)
| subset(X1,esk110_0) ),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_12,lemma,
( ~ relation_of2_as_subset(X1,X3,X2)
| subset(relation_rng(X1),X2) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_13,negated_conjecture,
relation_of2_as_subset(esk112_0,esk111_0,esk109_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_14,lemma,
( ~ subset(X1,X2)
| ~ subset(X2,esk109_0)
| subset(X1,esk110_0) ),
inference(spm,[status(thm)],[c_0_8,c_0_11]) ).
cnf(c_0_15,negated_conjecture,
subset(relation_rng(esk112_0),esk109_0),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
fof(c_0_16,plain,
! [X558] : subset(X558,X558),
inference(variable_rename,[status(thm)],[inference(fof_simplification,[status(thm)],[reflexivity_r1_tarski])]) ).
fof(c_0_17,lemma,
! [X618,X619,X620,X621] :
( relation_of2_as_subset(X621,X620,X619)
| ~ subset(relation_rng(X621),X619)
| ~ relation_of2_as_subset(X621,X620,X618) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t14_relset_1])])]) ).
cnf(c_0_18,lemma,
( ~ subset(X1,relation_rng(esk112_0))
| subset(X1,esk110_0) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_19,plain,
subset(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_20,lemma,
( ~ subset(relation_rng(X1),X4)
| ~ relation_of2_as_subset(X1,X2,X3)
| relation_of2_as_subset(X1,X2,X4) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_21,lemma,
subset(relation_rng(esk112_0),esk110_0),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_22,lemma,
( ~ relation_of2_as_subset(esk112_0,X1,X2)
| relation_of2_as_subset(esk112_0,X1,esk110_0) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_23,negated_conjecture,
~ relation_of2_as_subset(esk112_0,esk111_0,esk110_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_24,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_13]),c_0_23]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU264+2 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.13/0.42 % Computer : n018.cluster.edu
% 0.13/0.42 % Model : x86_64 x86_64
% 0.13/0.42 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.42 % Memory : 8046.5625MB
% 0.13/0.42 % OS : Linux 6.8.0-71-generic
% 0.13/0.42 % CPULimit : 300
% 0.13/0.42 % WCLimit : 300
% 0.13/0.42 % DateTime : Mon Sep 21 06:07:13 UTC 2026
% 0.13/0.42 % CPUTime :
% 0.13/0.42 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.13/0.49 Running first-order theorem proving
% 0.13/0.49 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
% 2.90/0.90 % Version: 3.5.1
% 2.90/0.90 % Preprocessing class: FSLSSMSSSSSNFFN.
% 2.90/0.90 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.90/0.90 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 2.90/0.90 % Starting new_bool_3 with 300s (1) cores
% 2.90/0.90 % Starting new_bool_1 with 300s (1) cores
% 2.90/0.90 % Starting sh5l with 300s (1) cores
% 2.90/0.90 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 1134749 completed with status 0
% 2.90/0.90 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 2.90/0.90 % Preprocessing class: FSLSSMSSSSSNFFN.
% 2.90/0.90 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.90/0.90 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 2.90/0.90 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 2.90/0.90 % No SInE strategy applied
% 2.90/0.90 % Search class: FGHSM-FSLM32-MFFFFFNN
% 2.90/0.90 % Scheduled 12 strats onto 5 cores with 1500 seconds (1500 total)
% 2.90/0.90 % Starting SubtermCWHack with 136s (1) cores
% 2.90/0.90 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 2.90/0.90 % Starting G-E--_107_B42_F1_PI_SE_Q4_CS_SP_PS_S5PRR_S0Y with 123s (1) cores
% 2.90/0.90 % Starting U----_100_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_ND_S04AN with 123s (1) cores
% 2.90/0.90 % Starting G-E--_208_C18_F1_SE_CS_SP_PI_PS_S5PRR_S032N with 123s (1) cores
% 2.90/0.90 % U----_100_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_ND_S04AN with pid 1134759 completed with status 0
% 2.90/0.90 % Result found by U----_100_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_ND_S04AN
% 2.90/0.90 % Preprocessing class: FSLSSMSSSSSNFFN.
% 2.90/0.90 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.90/0.90 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 2.90/0.90 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 2.90/0.90 % No SInE strategy applied
% 2.90/0.90 % Search class: FGHSM-FSLM32-MFFFFFNN
% 2.90/0.90 % Scheduled 12 strats onto 5 cores with 1500 seconds (1500 total)
% 2.90/0.90 % Starting SubtermCWHack with 136s (1) cores
% 2.90/0.90 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 2.90/0.90 % Starting G-E--_107_B42_F1_PI_SE_Q4_CS_SP_PS_S5PRR_S0Y with 123s (1) cores
% 2.90/0.90 % Starting U----_100_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_ND_S04AN with 123s (1) cores
% 2.90/0.90 % Preprocessing time : 0.011 s
% 2.90/0.90 % Presaturation interreduction done
% 2.90/0.90
% 2.90/0.90 % Proof found!
% 2.90/0.90 % SZS status Theorem
% 2.90/0.90 % SZS output start CNFRefutation
% See solution above
% 2.90/0.90 % Parsed axioms : 331
% 2.90/0.90 % Removed by relevancy pruning/SinE : 0
% 2.90/0.90 % Initial clauses : 707
% 2.90/0.90 % Removed in clause preprocessing : 31
% 2.90/0.90 % Initial clauses in saturation : 676
% 2.90/0.90 % Processed clauses : 3115
% 2.90/0.90 % ...of these trivial : 23
% 2.90/0.90 % ...subsumed : 1066
% 2.90/0.90 % ...remaining for further processing : 2026
% 2.90/0.90 % Other redundant clauses eliminated : 127
% 2.90/0.90 % Clauses deleted for lack of memory : 0
% 2.90/0.90 % Backward-subsumed : 25
% 2.90/0.90 % Backward-rewritten : 42
% 2.90/0.90 % Generated clauses : 8325
% 2.90/0.90 % ...of the previous two non-redundant : 6844
% 2.90/0.90 % ...aggressively subsumed : 0
% 2.90/0.90 % Contextual simplify-reflections : 53
% 2.90/0.90 % Paramodulations : 8206
% 2.90/0.90 % Factorizations : 0
% 2.90/0.90 % NegExts : 0
% 2.90/0.90 % Equation resolutions : 130
% 2.90/0.90 % Disequality decompositions : 0
% 2.90/0.90 % Total rewrite steps : 2466
% 2.90/0.90 % ...of those cached : 2209
% 2.90/0.90 % Propositional unsat checks : 0
% 2.90/0.90 % Propositional check models : 0
% 2.90/0.90 % Propositional check unsatisfiable : 0
% 2.90/0.90 % Propositional clauses : 0
% 2.90/0.90 % Propositional clauses after purity: 0
% 2.90/0.90 % Propositional unsat core size : 0
% 2.90/0.90 % Propositional preprocessing time : 0.000
% 2.90/0.90 % Propositional encoding time : 0.000
% 2.90/0.90 % Propositional solver time : 0.000
% 2.90/0.90 % Success case prop preproc time : 0.000
% 2.90/0.90 % Success case prop encoding time : 0.000
% 2.90/0.90 % Success case prop solver time : 0.000
% 2.90/0.90 % Current number of processed clauses : 1248
% 2.90/0.90 % Positive orientable unit clauses : 163
% 2.90/0.90 % Positive unorientable unit clauses: 3
% 2.90/0.90 % Negative unit clauses : 62
% 2.90/0.90 % Non-unit-clauses : 1020
% 2.90/0.90 % Current number of unprocessed clauses: 4965
% 2.90/0.90 % ...number of literals in the above : 15562
% 2.90/0.90 % Current number of archived formulas : 0
% 2.90/0.90 % Current number of archived clauses : 688
% 2.90/0.90 % Clause-clause subsumption calls (NU) : 346719
% 2.90/0.90 % Rec. Clause-clause subsumption calls : 237818
% 2.90/0.90 % Non-unit clause-clause subsumptions : 944
% 2.90/0.90 % Unit Clause-clause subsumption calls : 20687
% 2.90/0.90 % Rewrite failures with RHS unbound : 0
% 2.90/0.90 % BW rewrite match attempts : 101
% 2.90/0.90 % BW rewrite match successes : 68
% 2.90/0.90 % Condensation attempts : 0
% 2.90/0.90 % Condensation successes : 0
% 2.90/0.90 % Termbank termtop insertions : 138407
% 2.90/0.90 % Search garbage collected termcells : 12266
% 2.90/0.90
% 2.90/0.90 % -------------------------------------------------
% 2.90/0.90 % User time : 0.347 s
% 2.90/0.90 % System time : 0.015 s
% 2.90/0.90 % Total time : 0.362 s
% 2.90/0.90 % Maximum resident set size: 6048 pages
% 2.90/0.90
% 2.90/0.90 % -------------------------------------------------
% 2.90/0.90 % User time : 1.498 s
% 2.90/0.90 % System time : 0.085 s
% 2.90/0.90 % Total time : 1.583 s
% 2.90/0.90 % Maximum resident set size: 4864 pages
% 2.90/0.90 % E exiting
%------------------------------------------------------------------------------