%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SET731+4 : TPTP v9.3.1. Bugfixed v2.2.1.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/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:15:06 PM UTC 2026
% Result : Theorem 0.14s 10.47s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 3
% Syntax : Number of formulae : 23 ( 3 unt; 0 def)
% Number of atoms : 94 ( 4 equ)
% Maximal formula atoms : 12 ( 4 avg)
% Number of connectives : 114 ( 43 ~; 42 |; 20 &)
% ( 4 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 6 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-3 aty)
% Number of functors : 9 ( 9 usr; 5 con; 0-4 aty)
% Number of variables : 76 ( 0 sgn 38 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(thII22,conjecture,
! [X6,X10,X1,X2,X11] :
( ( ! [X3,X5] :
( ( member(X5,X11)
& member(X3,X1) )
=> ( apply(X10,X3,X5)
<=> apply(X6,X3,X5) ) )
& image2(X6,X1) = X11
& subset(X11,X2)
& maps(X6,X1,X2) )
=> surjective(X10,X1,X11) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',thII22) ).
fof(image2,axiom,
! [X6,X1,X5] :
( member(X5,image2(X6,X1))
<=> ? [X3] :
( apply(X6,X3,X5)
& member(X3,X1) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET006+1.ax',image2) ).
fof(surjective,axiom,
! [X6,X1,X2] :
( surjective(X6,X1,X2)
<=> ! [X5] :
( member(X5,X2)
=> ? [X4] :
( apply(X6,X4,X5)
& member(X4,X1) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET006+1.ax',surjective) ).
fof(c_0_3,negated_conjecture,
~ ! [X6,X10,X1,X2,X11] :
( ( ! [X3,X5] :
( ( member(X5,X11)
& member(X3,X1) )
=> ( apply(X10,X3,X5)
<=> apply(X6,X3,X5) ) )
& image2(X6,X1) = X11
& subset(X11,X2)
& maps(X6,X1,X2) )
=> surjective(X10,X1,X11) ),
inference(assume_negation,[status(cth)],[thII22]) ).
fof(c_0_4,plain,
! [X37,X38,X39,X41,X42,X43,X44] :
( ( member(X43,image2(X41,X42))
| ~ apply(X41,X44,X43)
| ~ member(X44,X42) )
& ( ~ member(X39,image2(X37,X38))
| apply(X37,esk8_3(X37,X38,X39),X39) )
& ( ~ member(X39,image2(X37,X38))
| member(esk8_3(X37,X38,X39),X38) ) ),
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)],[image2])])])])])])]) ).
fof(c_0_5,negated_conjecture,
! [X22,X23] :
( ~ surjective(esk2_0,esk3_0,esk5_0)
& ( ~ member(X23,esk5_0)
| ~ member(X22,esk3_0)
| apply(esk2_0,X22,X23)
| ~ apply(esk1_0,X22,X23) )
& ( ~ member(X23,esk5_0)
| ~ member(X22,esk3_0)
| apply(esk1_0,X22,X23)
| ~ apply(esk2_0,X22,X23) )
& image2(esk1_0,esk3_0) = esk5_0
& subset(esk5_0,esk4_0)
& maps(esk1_0,esk3_0,esk4_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_3])])])])])]) ).
cnf(c_0_6,plain,
( ~ apply(X3,X1,X4)
| ~ member(X1,X2)
| member(X4,image2(X3,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,negated_conjecture,
( ~ member(X2,esk5_0)
| ~ member(X1,esk3_0)
| ~ apply(esk1_0,X1,X2)
| apply(esk2_0,X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
fof(c_0_8,plain,
! [X24,X25,X26,X27,X29,X30,X31,X33] :
( ( surjective(X29,X30,X31)
| ~ apply(X29,X33,esk7_3(X29,X30,X31))
| ~ member(X33,X30) )
& ( surjective(X29,X30,X31)
| member(esk7_3(X29,X30,X31),X31) )
& ( ~ surjective(X24,X25,X26)
| ~ member(X27,X26)
| apply(X24,esk6_4(X24,X25,X26,X27),X27) )
& ( ~ surjective(X24,X25,X26)
| ~ member(X27,X26)
| member(esk6_4(X24,X25,X26,X27),X25) ) ),
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)],[surjective])])])])])])]) ).
cnf(c_0_9,negated_conjecture,
( ~ member(X3,X2)
| ~ member(X3,esk3_0)
| ~ member(X1,esk5_0)
| ~ apply(esk1_0,X3,X1)
| member(X1,image2(esk2_0,X2)) ),
inference(spm,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_10,plain,
( ~ member(X3,image2(X1,X2))
| apply(X1,esk8_3(X1,X2,X3),X3) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_11,plain,
( ~ apply(X3,X1,esk7_3(X3,X2,X4))
| ~ member(X1,X2)
| surjective(X3,X2,X4) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_12,negated_conjecture,
( ~ member(X1,esk5_0)
| ~ member(X1,image2(esk1_0,X3))
| ~ member(esk8_3(esk1_0,X3,X1),X2)
| ~ member(esk8_3(esk1_0,X3,X1),esk3_0)
| member(X1,image2(esk2_0,X2)) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_13,plain,
( ~ member(X3,image2(X1,X2))
| member(esk8_3(X1,X2,X3),X2) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_14,negated_conjecture,
image2(esk1_0,esk3_0) = esk5_0,
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_15,plain,
( ~ member(esk7_3(X1,X2,X3),image2(X1,X4))
| ~ member(esk8_3(X1,X4,esk7_3(X1,X2,X3)),X2)
| surjective(X1,X2,X3) ),
inference(spm,[status(thm)],[c_0_11,c_0_10]) ).
cnf(c_0_16,negated_conjecture,
( ~ member(X1,esk5_0)
| ~ member(esk8_3(esk1_0,esk3_0,X1),X2)
| member(X1,image2(esk2_0,X2)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14])]) ).
cnf(c_0_17,plain,
( ~ member(esk7_3(X1,X2,X3),image2(X1,X2))
| surjective(X1,X2,X3) ),
inference(spm,[status(thm)],[c_0_15,c_0_13]) ).
cnf(c_0_18,negated_conjecture,
( ~ member(X1,esk5_0)
| member(X1,image2(esk2_0,esk3_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_13]),c_0_14])]) ).
cnf(c_0_19,negated_conjecture,
( ~ member(esk7_3(esk2_0,esk3_0,X1),esk5_0)
| surjective(esk2_0,esk3_0,X1) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_20,plain,
( surjective(X1,X2,X3)
| member(esk7_3(X1,X2,X3),X3) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_21,negated_conjecture,
~ surjective(esk2_0,esk3_0,esk5_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_22,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET731+4 : TPTP v9.3.1. Bugfixed v2.2.1.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/10.38 % Computer : n019.cluster.edu
% 0.09/10.38 % Model : x86_64 x86_64
% 0.09/10.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/10.38 % Memory : 8046.5625MB
% 0.09/10.38 % OS : Linux 6.8.0-71-generic
% 0.09/10.38 % CPULimit : 300
% 0.09/10.38 % WCLimit : 300
% 0.09/10.38 % DateTime : Mon Sep 21 05:34:46 UTC 2026
% 0.09/10.38 % CPUTime :
% 0.09/10.38 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.14/10.43 Running first-order theorem proving
% 0.14/10.43 Running: /export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p
% 0.14/10.47 % Version: 3.5.1
% 0.14/10.47 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.14/10.47 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/10.47 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.14/10.47 % Starting new_bool_3 with 300s (1) cores
% 0.14/10.47 % Starting new_bool_1 with 300s (1) cores
% 0.14/10.47 % Starting sh5l with 300s (1) cores
% 0.14/10.47 % new_bool_1 with pid 1786753 completed with status 0
% 0.14/10.47 % Result found by new_bool_1
% 0.14/10.47 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.14/10.47 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/10.47 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.14/10.47 % Starting new_bool_3 with 300s (1) cores
% 0.14/10.47 % Starting new_bool_1 with 300s (1) cores
% 0.14/10.47 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.14/10.47 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.14/10.47 % Search class: FGUSF-FFMS33-SFFFFFNN
% 0.14/10.47 % partial match(1): FGUSS-FFMS33-SFFFFFNN
% 0.14/10.47 % Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.14/10.47 % Starting SubtermCWHack with 31s (1) cores
% 0.14/10.47 % SubtermCWHack with pid 1786756 completed with status 0
% 0.14/10.47 % Result found by SubtermCWHack
% 0.14/10.47 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.14/10.47 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/10.47 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.14/10.47 % Starting new_bool_3 with 300s (1) cores
% 0.14/10.47 % Starting new_bool_1 with 300s (1) cores
% 0.14/10.47 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.14/10.47 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.14/10.47 % Search class: FGUSF-FFMS33-SFFFFFNN
% 0.14/10.47 % partial match(1): FGUSS-FFMS33-SFFFFFNN
% 0.14/10.47 % Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.14/10.47 % Starting SubtermCWHack with 31s (1) cores
% 0.14/10.47 % Preprocessing time : 0.002 s
% 0.14/10.47
% 0.14/10.47 % Proof found!
% 0.14/10.47 % SZS status Theorem
% 0.14/10.47 % SZS output start CNFRefutation
% See solution above
% 0.14/10.47 % Parsed axioms : 29
% 0.14/10.47 % Removed by relevancy pruning/SinE : 22
% 0.14/10.47 % Initial clauses : 41
% 0.14/10.47 % Removed in clause preprocessing : 0
% 0.14/10.47 % Initial clauses in saturation : 41
% 0.14/10.47 % Processed clauses : 157
% 0.14/10.47 % ...of these trivial : 0
% 0.14/10.47 % ...subsumed : 19
% 0.14/10.47 % ...remaining for further processing : 138
% 0.14/10.47 % Other redundant clauses eliminated : 0
% 0.14/10.47 % Clauses deleted for lack of memory : 0
% 0.14/10.47 % Backward-subsumed : 0
% 0.14/10.47 % Backward-rewritten : 0
% 0.14/10.47 % Generated clauses : 228
% 0.14/10.47 % ...of the previous two non-redundant : 215
% 0.14/10.47 % ...aggressively subsumed : 0
% 0.14/10.47 % Contextual simplify-reflections : 2
% 0.14/10.47 % Paramodulations : 228
% 0.14/10.47 % Factorizations : 0
% 0.14/10.47 % NegExts : 0
% 0.14/10.47 % Equation resolutions : 0
% 0.14/10.47 % Disequality decompositions : 0
% 0.14/10.47 % Total rewrite steps : 7
% 0.14/10.47 % ...of those cached : 2
% 0.14/10.47 % Propositional unsat checks : 0
% 0.14/10.47 % Propositional check models : 0
% 0.14/10.47 % Propositional check unsatisfiable : 0
% 0.14/10.47 % Propositional clauses : 0
% 0.14/10.47 % Propositional clauses after purity: 0
% 0.14/10.47 % Propositional unsat core size : 0
% 0.14/10.47 % Propositional preprocessing time : 0.000
% 0.14/10.47 % Propositional encoding time : 0.000
% 0.14/10.47 % Propositional solver time : 0.000
% 0.14/10.47 % Success case prop preproc time : 0.000
% 0.14/10.47 % Success case prop encoding time : 0.000
% 0.14/10.47 % Success case prop solver time : 0.000
% 0.14/10.47 % Current number of processed clauses : 138
% 0.14/10.47 % Positive orientable unit clauses : 11
% 0.14/10.47 % Positive unorientable unit clauses: 0
% 0.14/10.47 % Negative unit clauses : 1
% 0.14/10.47 % Non-unit-clauses : 126
% 0.14/10.47 % Current number of unprocessed clauses: 99
% 0.14/10.47 % ...number of literals in the above : 510
% 0.14/10.47 % Current number of archived formulas : 0
% 0.14/10.47 % Current number of archived clauses : 0
% 0.14/10.47 % Clause-clause subsumption calls (NU) : 2286
% 0.14/10.47 % Rec. Clause-clause subsumption calls : 1571
% 0.14/10.47 % Non-unit clause-clause subsumptions : 21
% 0.14/10.47 % Unit Clause-clause subsumption calls : 2
% 0.14/10.47 % Rewrite failures with RHS unbound : 0
% 0.14/10.47 % BW rewrite match attempts : 10
% 0.14/10.47 % BW rewrite match successes : 0
% 0.14/10.47 % Condensation attempts : 0
% 0.14/10.47 % Condensation successes : 0
% 0.14/10.47 % Termbank termtop insertions : 8648
% 0.14/10.47 % Search garbage collected termcells : 1189
% 0.14/10.47
% 0.14/10.47 % -------------------------------------------------
% 0.14/10.47 % User time : 0.017 s
% 0.14/10.47 % System time : 0.004 s
% 0.14/10.47 % Total time : 0.022 s
% 0.14/10.47 % Maximum resident set size: 3692 pages
% 0.14/10.47
% 0.14/10.47 % -------------------------------------------------
% 0.14/10.47 % User time : 0.019 s
% 0.14/10.47 % System time : 0.011 s
% 0.14/10.47 % Total time : 0.029 s
% 0.14/10.47 % Maximum resident set size: 4608 pages
% 0.14/10.47 % E exiting
%------------------------------------------------------------------------------