%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : SEU264+1 : 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 : n005.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:46 PM UTC 2026
% Result : Theorem 0.29s 0.57s
% Output : CNFRefutation 0.29s
% 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,axiom,
! [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,axiom,
! [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,axiom,
! [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,plain,
! [X34,X35,X36] :
( subset(X34,X36)
| ~ subset(X35,X36)
| ~ subset(X34,X35) ),
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(esk7_0,esk6_0,esk5_0)
& subset(esk4_0,esk5_0)
& relation_of2_as_subset(esk7_0,esk6_0,esk4_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,plain,
( ~ subset(X2,X3)
| ~ subset(X1,X2)
| subset(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_9,negated_conjecture,
subset(esk4_0,esk5_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
fof(c_0_10,plain,
! [X23,X24,X25] :
( ( ~ relation_of2_as_subset(X25,X23,X24)
| subset(relation_rng(X25),X24) )
& ( ~ relation_of2_as_subset(X25,X23,X24)
| subset(relation_dom(X25),X23) ) ),
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,esk4_0)
| subset(X1,esk5_0) ),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_12,plain,
( ~ 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(esk7_0,esk6_0,esk4_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_14,negated_conjecture,
( ~ subset(X1,X2)
| ~ subset(X2,esk4_0)
| subset(X1,esk5_0) ),
inference(spm,[status(thm)],[c_0_8,c_0_11]) ).
cnf(c_0_15,negated_conjecture,
subset(relation_rng(esk7_0),esk4_0),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
fof(c_0_16,plain,
! [X22] : subset(X22,X22),
inference(variable_rename,[status(thm)],[inference(fof_simplification,[status(thm)],[reflexivity_r1_tarski])]) ).
fof(c_0_17,plain,
! [X26,X27,X28,X29] :
( relation_of2_as_subset(X29,X28,X27)
| ~ subset(relation_rng(X29),X27)
| ~ relation_of2_as_subset(X29,X28,X26) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t14_relset_1])])]) ).
cnf(c_0_18,negated_conjecture,
( ~ subset(X1,relation_rng(esk7_0))
| subset(X1,esk5_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,plain,
( ~ 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,negated_conjecture,
subset(relation_rng(esk7_0),esk5_0),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_22,negated_conjecture,
( ~ relation_of2_as_subset(esk7_0,X1,X2)
| relation_of2_as_subset(esk7_0,X1,esk5_0) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_23,negated_conjecture,
~ relation_of2_as_subset(esk7_0,esk6_0,esk5_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.05 % Problem : SEU264+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.08 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.18/0.43 % Computer : n005.cluster.edu
% 0.18/0.43 % Model : x86_64 x86_64
% 0.18/0.43 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.43 % Memory : 8046.5625MB
% 0.18/0.43 % OS : Linux 6.8.0-71-generic
% 0.18/0.43 % CPULimit : 300
% 0.18/0.43 % WCLimit : 300
% 0.18/0.43 % DateTime : Mon Sep 21 06:05:02 UTC 2026
% 0.18/0.44 % CPUTime :
% 0.18/0.44 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.18/0.52 Running first-order theorem proving
% 0.18/0.52 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.29/0.57 % Version: 3.5.1
% 0.29/0.57 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.29/0.57 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.29/0.57 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.29/0.57 % Starting new_bool_3 with 300s (1) cores
% 0.29/0.57 % Starting new_bool_1 with 300s (1) cores
% 0.29/0.57 % Starting sh5l with 300s (1) cores
% 0.29/0.57 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 2716904 completed with status 0
% 0.29/0.57 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.29/0.57 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.29/0.57 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.29/0.57 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.29/0.57 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.29/0.57 % No SInE strategy applied
% 0.29/0.57 % Search class: FHUNM-FFSF21-SFFFFFNN
% 0.29/0.57 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.29/0.57 % Starting SubtermCWHack with 136s (1) cores
% 0.29/0.57 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.29/0.57 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.29/0.57 % Starting new_bool_3 with 136s (1) cores
% 0.29/0.57 % Starting new_bool_1 with 136s (1) cores
% 0.29/0.57 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 2716909 completed with status 0
% 0.29/0.57 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.29/0.57 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.29/0.57 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.29/0.57 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.29/0.57 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.29/0.57 % No SInE strategy applied
% 0.29/0.57 % Search class: FHUNM-FFSF21-SFFFFFNN
% 0.29/0.57 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.29/0.57 % Starting SubtermCWHack with 136s (1) cores
% 0.29/0.57 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.29/0.57 % Preprocessing time : 0.002 s
% 0.29/0.57 % Presaturation interreduction done
% 0.29/0.57
% 0.29/0.57 % Proof found!
% 0.29/0.57 % SZS status Theorem
% 0.29/0.57 % SZS output start CNFRefutation
% See solution above
% 0.29/0.57 % Parsed axioms : 18
% 0.29/0.57 % Removed by relevancy pruning/SinE : 0
% 0.29/0.57 % Initial clauses : 23
% 0.29/0.57 % Removed in clause preprocessing : 6
% 0.29/0.57 % Initial clauses in saturation : 17
% 0.29/0.57 % Processed clauses : 55
% 0.29/0.57 % ...of these trivial : 0
% 0.29/0.57 % ...subsumed : 2
% 0.29/0.57 % ...remaining for further processing : 53
% 0.29/0.57 % Other redundant clauses eliminated : 0
% 0.29/0.57 % Clauses deleted for lack of memory : 0
% 0.29/0.57 % Backward-subsumed : 0
% 0.29/0.57 % Backward-rewritten : 0
% 0.29/0.57 % Generated clauses : 43
% 0.29/0.57 % ...of the previous two non-redundant : 35
% 0.29/0.57 % ...aggressively subsumed : 0
% 0.29/0.57 % Contextual simplify-reflections : 0
% 0.29/0.57 % Paramodulations : 43
% 0.29/0.57 % Factorizations : 0
% 0.29/0.57 % NegExts : 0
% 0.29/0.57 % Equation resolutions : 0
% 0.29/0.57 % Disequality decompositions : 0
% 0.29/0.57 % Total rewrite steps : 4
% 0.29/0.57 % ...of those cached : 0
% 0.29/0.57 % Propositional unsat checks : 0
% 0.29/0.57 % Propositional check models : 0
% 0.29/0.57 % Propositional check unsatisfiable : 0
% 0.29/0.57 % Propositional clauses : 0
% 0.29/0.57 % Propositional clauses after purity: 0
% 0.29/0.57 % Propositional unsat core size : 0
% 0.29/0.57 % Propositional preprocessing time : 0.000
% 0.29/0.57 % Propositional encoding time : 0.000
% 0.29/0.57 % Propositional solver time : 0.000
% 0.29/0.57 % Success case prop preproc time : 0.000
% 0.29/0.57 % Success case prop encoding time : 0.000
% 0.29/0.57 % Success case prop solver time : 0.000
% 0.29/0.57 % Current number of processed clauses : 36
% 0.29/0.57 % Positive orientable unit clauses : 14
% 0.29/0.57 % Positive unorientable unit clauses: 0
% 0.29/0.57 % Negative unit clauses : 1
% 0.29/0.57 % Non-unit-clauses : 21
% 0.29/0.57 % Current number of unprocessed clauses: 14
% 0.29/0.57 % ...number of literals in the above : 19
% 0.29/0.57 % Current number of archived formulas : 0
% 0.29/0.57 % Current number of archived clauses : 17
% 0.29/0.57 % Clause-clause subsumption calls (NU) : 51
% 0.29/0.57 % Rec. Clause-clause subsumption calls : 48
% 0.29/0.57 % Non-unit clause-clause subsumptions : 2
% 0.29/0.57 % Unit Clause-clause subsumption calls : 21
% 0.29/0.57 % Rewrite failures with RHS unbound : 0
% 0.29/0.57 % BW rewrite match attempts : 4
% 0.29/0.57 % BW rewrite match successes : 0
% 0.29/0.57 % Condensation attempts : 0
% 0.29/0.57 % Condensation successes : 0
% 0.29/0.57 % Termbank termtop insertions : 1608
% 0.29/0.57 % Search garbage collected termcells : 188
% 0.29/0.57
% 0.29/0.57 % -------------------------------------------------
% 0.29/0.57 % User time : 0.009 s
% 0.29/0.57 % System time : 0.006 s
% 0.29/0.57 % Total time : 0.015 s
% 0.29/0.57 % Maximum resident set size: 3388 pages
% 0.29/0.57
% 0.29/0.57 % -------------------------------------------------
% 0.29/0.57 % User time : 0.019 s
% 0.29/0.57 % System time : 0.022 s
% 0.29/0.57 % Total time : 0.042 s
% 0.29/0.57 % Maximum resident set size: 4608 pages
% 0.29/0.57 % E exiting
%------------------------------------------------------------------------------