%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : SET956+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 : n006.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:18:59 PM UTC 2026
% Result : Theorem 0.15s 0.42s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 3
% Syntax : Number of formulae : 17 ( 3 unt; 0 def)
% Number of atoms : 56 ( 3 equ)
% Maximal formula atoms : 9 ( 3 avg)
% Number of connectives : 63 ( 24 ~; 21 |; 12 &)
% ( 1 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 6 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 4 con; 0-4 aty)
% Number of variables : 48 ( 2 sgn 32 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t109_zfmisc_1,conjecture,
! [X1,X2,X3,X4] :
( ( ! [X5,X6] :
( in(ordered_pair(X5,X6),X1)
=> in(ordered_pair(X5,X6),X4) )
& subset(X1,cartesian_product2(X2,X3)) )
=> subset(X1,X4) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t109_zfmisc_1) ).
fof(t103_zfmisc_1,axiom,
! [X1,X2,X3,X4] :
~ ( ! [X5,X6] :
~ ( X4 = ordered_pair(X5,X6)
& in(X6,X3)
& in(X5,X2) )
& in(X4,X1)
& subset(X1,cartesian_product2(X2,X3)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t103_zfmisc_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,negated_conjecture,
~ ! [X1,X2,X3,X4] :
( ( ! [X5,X6] :
( in(ordered_pair(X5,X6),X1)
=> in(ordered_pair(X5,X6),X4) )
& subset(X1,cartesian_product2(X2,X3)) )
=> subset(X1,X4) ),
inference(assume_negation,[status(cth)],[t109_zfmisc_1]) ).
fof(c_0_4,negated_conjecture,
! [X11,X12] :
( ~ subset(esk1_0,esk4_0)
& ( in(ordered_pair(X11,X12),esk4_0)
| ~ in(ordered_pair(X11,X12),esk1_0) )
& subset(esk1_0,cartesian_product2(esk2_0,esk3_0)) ),
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_3])])])])]) ).
fof(c_0_5,plain,
! [X24,X25,X26,X27] :
( ( ~ in(X27,X24)
| ~ subset(X24,cartesian_product2(X25,X26))
| X27 = ordered_pair(esk6_4(X24,X25,X26,X27),esk7_4(X24,X25,X26,X27)) )
& ( ~ in(X27,X24)
| ~ subset(X24,cartesian_product2(X25,X26))
| in(esk7_4(X24,X25,X26,X27),X26) )
& ( ~ in(X27,X24)
| ~ subset(X24,cartesian_product2(X25,X26))
| in(esk6_4(X24,X25,X26,X27),X25) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t103_zfmisc_1])])])])]) ).
cnf(c_0_6,negated_conjecture,
( ~ in(ordered_pair(X1,X2),esk1_0)
| in(ordered_pair(X1,X2),esk4_0) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,plain,
( ~ in(X1,X2)
| ~ subset(X2,cartesian_product2(X3,X4))
| X1 = ordered_pair(esk6_4(X2,X3,X4,X1),esk7_4(X2,X3,X4,X1)) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
fof(c_0_8,plain,
! [X13,X14,X15,X16,X17] :
( ( subset(X16,X17)
| ~ in(esk5_2(X16,X17),X17) )
& ( subset(X16,X17)
| in(esk5_2(X16,X17),X16) )
& ( in(X15,X14)
| ~ in(X15,X13)
| ~ subset(X13,X14) ) ),
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_9,negated_conjecture,
( ~ in(X1,X2)
| ~ in(X1,esk1_0)
| ~ subset(X2,cartesian_product2(X3,X4))
| in(X1,esk4_0) ),
inference(spm,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_10,negated_conjecture,
subset(esk1_0,cartesian_product2(esk2_0,esk3_0)),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_11,plain,
( ~ in(esk5_2(X1,X2),X2)
| subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_12,negated_conjecture,
( ~ in(X1,esk1_0)
| in(X1,esk4_0) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_13,negated_conjecture,
( ~ in(esk5_2(X1,esk4_0),esk1_0)
| subset(X1,esk4_0) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_14,plain,
( subset(X1,X2)
| in(esk5_2(X1,X2),X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_15,negated_conjecture,
~ subset(esk1_0,esk4_0),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_16,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_15]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET956+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.11/0.37 % Computer : n006.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:44:27 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.37 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.15/0.41 Running first-order theorem proving
% 0.15/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.15/0.42 % Version: 3.5.1
% 0.15/0.42 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.42 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.42 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.42 % Starting new_bool_3 with 300s (1) cores
% 0.15/0.42 % Starting new_bool_1 with 300s (1) cores
% 0.15/0.42 % Starting sh5l with 300s (1) cores
% 0.15/0.42 % new_bool_3 with pid 2120472 completed with status 0
% 0.15/0.42 % Result found by new_bool_3
% 0.15/0.42 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.42 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.42 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.42 % Starting new_bool_3 with 300s (1) cores
% 0.15/0.42 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.15/0.42 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/0.42 % Search class: FGHSF-FFSF32-SFFFFFNN
% 0.15/0.42 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.42 % Starting SubtermCWHack with 31s (1) cores
% 0.15/0.42 % SubtermCWHack with pid 2120478 completed with status 0
% 0.15/0.42 % Result found by SubtermCWHack
% 0.15/0.42 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.42 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.42 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.42 % Starting new_bool_3 with 300s (1) cores
% 0.15/0.42 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.15/0.42 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/0.42 % Search class: FGHSF-FFSF32-SFFFFFNN
% 0.15/0.42 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.42 % Starting SubtermCWHack with 31s (1) cores
% 0.15/0.42 % Preprocessing time : 0.001 s
% 0.15/0.42
% 0.15/0.42 % Proof found!
% 0.15/0.42 % SZS status Theorem
% 0.15/0.42 % SZS output start CNFRefutation
% See solution above
% 0.15/0.42 % Parsed axioms : 10
% 0.15/0.42 % Removed by relevancy pruning/SinE : 2
% 0.15/0.42 % Initial clauses : 14
% 0.15/0.42 % Removed in clause preprocessing : 0
% 0.15/0.42 % Initial clauses in saturation : 14
% 0.15/0.42 % Processed clauses : 34
% 0.15/0.42 % ...of these trivial : 0
% 0.15/0.42 % ...subsumed : 1
% 0.15/0.42 % ...remaining for further processing : 33
% 0.15/0.42 % Other redundant clauses eliminated : 0
% 0.15/0.42 % Clauses deleted for lack of memory : 0
% 0.15/0.42 % Backward-subsumed : 3
% 0.15/0.42 % Backward-rewritten : 0
% 0.15/0.42 % Generated clauses : 29
% 0.15/0.42 % ...of the previous two non-redundant : 25
% 0.15/0.42 % ...aggressively subsumed : 0
% 0.15/0.42 % Contextual simplify-reflections : 0
% 0.15/0.42 % Paramodulations : 29
% 0.15/0.42 % Factorizations : 0
% 0.15/0.42 % NegExts : 0
% 0.15/0.42 % Equation resolutions : 0
% 0.15/0.42 % Disequality decompositions : 0
% 0.15/0.42 % Total rewrite steps : 2
% 0.15/0.42 % ...of those cached : 0
% 0.15/0.42 % Propositional unsat checks : 0
% 0.15/0.42 % Propositional check models : 0
% 0.15/0.42 % Propositional check unsatisfiable : 0
% 0.15/0.42 % Propositional clauses : 0
% 0.15/0.42 % Propositional clauses after purity: 0
% 0.15/0.42 % Propositional unsat core size : 0
% 0.15/0.42 % Propositional preprocessing time : 0.000
% 0.15/0.42 % Propositional encoding time : 0.000
% 0.15/0.42 % Propositional solver time : 0.000
% 0.15/0.42 % Success case prop preproc time : 0.000
% 0.15/0.42 % Success case prop encoding time : 0.000
% 0.15/0.42 % Success case prop solver time : 0.000
% 0.15/0.42 % Current number of processed clauses : 30
% 0.15/0.42 % Positive orientable unit clauses : 3
% 0.15/0.42 % Positive unorientable unit clauses: 0
% 0.15/0.42 % Negative unit clauses : 6
% 0.15/0.42 % Non-unit-clauses : 21
% 0.15/0.42 % Current number of unprocessed clauses: 4
% 0.15/0.42 % ...number of literals in the above : 10
% 0.15/0.42 % Current number of archived formulas : 0
% 0.15/0.42 % Current number of archived clauses : 3
% 0.15/0.42 % Clause-clause subsumption calls (NU) : 85
% 0.15/0.42 % Rec. Clause-clause subsumption calls : 74
% 0.15/0.42 % Non-unit clause-clause subsumptions : 4
% 0.15/0.42 % Unit Clause-clause subsumption calls : 16
% 0.15/0.42 % Rewrite failures with RHS unbound : 0
% 0.15/0.42 % BW rewrite match attempts : 0
% 0.15/0.42 % BW rewrite match successes : 0
% 0.15/0.42 % Condensation attempts : 0
% 0.15/0.42 % Condensation successes : 0
% 0.15/0.42 % Termbank termtop insertions : 1316
% 0.15/0.42 % Search garbage collected termcells : 250
% 0.15/0.42
% 0.15/0.42 % -------------------------------------------------
% 0.15/0.42 % User time : 0.005 s
% 0.15/0.42 % System time : 0.003 s
% 0.15/0.42 % Total time : 0.008 s
% 0.15/0.42 % Maximum resident set size: 3640 pages
% 0.15/0.42
% 0.15/0.42 % -------------------------------------------------
% 0.15/0.42 % User time : 0.008 s
% 0.15/0.42 % System time : 0.003 s
% 0.15/0.42 % Total time : 0.012 s
% 0.15/0.42 % Maximum resident set size: 4864 pages
% 0.15/0.42 % E exiting
%------------------------------------------------------------------------------