%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SET734+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 : 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:15:06 PM UTC 2026
% Result : Theorem 0.25s 5.66s
% Output : CNFRefutation 0.25s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 4
% Syntax : Number of formulae : 21 ( 3 unt; 0 def)
% Number of atoms : 93 ( 0 equ)
% Maximal formula atoms : 18 ( 4 avg)
% Number of connectives : 117 ( 45 ~; 45 |; 19 &)
% ( 3 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 18 ( 6 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-3 aty)
% Number of functors : 9 ( 9 usr; 4 con; 0-7 aty)
% Number of variables : 86 ( 1 sgn 43 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
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(compose_function,axiom,
! [X10,X6,X1,X2,X11,X3,X12] :
( ( member(X12,X11)
& member(X3,X1) )
=> ( apply(compose_function(X10,X6,X1,X2,X11),X3,X12)
<=> ? [X5] :
( apply(X10,X5,X12)
& apply(X6,X3,X5)
& member(X5,X2) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET006+1.ax',compose_function) ).
fof(thII25,conjecture,
! [X6,X10,X1,X2] :
( ( identity(compose_function(X10,X6,X2,X1,X2),X2)
& maps(X6,X2,X1)
& maps(X10,X1,X2) )
=> surjective(X10,X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',thII25) ).
fof(identity,axiom,
! [X6,X1] :
( identity(X6,X1)
<=> ! [X3] :
( member(X3,X1)
=> apply(X6,X3,X3) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET006+1.ax',identity) ).
fof(c_0_4,plain,
! [X21,X22,X23,X24,X26,X27,X28,X30] :
( ( surjective(X26,X27,X28)
| ~ apply(X26,X30,esk6_3(X26,X27,X28))
| ~ member(X30,X27) )
& ( surjective(X26,X27,X28)
| member(esk6_3(X26,X27,X28),X28) )
& ( ~ surjective(X21,X22,X23)
| ~ member(X24,X23)
| apply(X21,esk5_4(X21,X22,X23,X24),X24) )
& ( ~ surjective(X21,X22,X23)
| ~ member(X24,X23)
| member(esk5_4(X21,X22,X23,X24),X22) ) ),
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])])])])])])]) ).
fof(c_0_5,plain,
! [X40,X41,X42,X43,X44,X45,X46,X48] :
( ( ~ member(X46,X44)
| ~ member(X45,X42)
| apply(compose_function(X40,X41,X42,X43,X44),X45,X46)
| ~ apply(X40,X48,X46)
| ~ apply(X41,X45,X48)
| ~ member(X48,X43) )
& ( ~ member(X46,X44)
| ~ member(X45,X42)
| ~ apply(compose_function(X40,X41,X42,X43,X44),X45,X46)
| apply(X40,esk8_7(X40,X41,X42,X43,X44,X45,X46),X46) )
& ( ~ member(X46,X44)
| ~ member(X45,X42)
| ~ apply(compose_function(X40,X41,X42,X43,X44),X45,X46)
| apply(X41,X45,esk8_7(X40,X41,X42,X43,X44,X45,X46)) )
& ( ~ member(X46,X44)
| ~ member(X45,X42)
| ~ apply(compose_function(X40,X41,X42,X43,X44),X45,X46)
| member(esk8_7(X40,X41,X42,X43,X44,X45,X46),X43) ) ),
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)],[compose_function])])])])])]) ).
fof(c_0_6,negated_conjecture,
~ ! [X6,X10,X1,X2] :
( ( identity(compose_function(X10,X6,X2,X1,X2),X2)
& maps(X6,X2,X1)
& maps(X10,X1,X2) )
=> surjective(X10,X1,X2) ),
inference(assume_negation,[status(cth)],[thII25]) ).
cnf(c_0_7,plain,
( ~ apply(X3,X1,esk6_3(X3,X2,X4))
| ~ member(X1,X2)
| surjective(X3,X2,X4) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_8,plain,
( ~ member(X7,X5)
| ~ member(X6,X3)
| ~ apply(compose_function(X1,X2,X3,X4,X5),X6,X7)
| apply(X1,esk8_7(X1,X2,X3,X4,X5,X6,X7),X7) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
fof(c_0_9,plain,
! [X34,X35,X36,X37,X38] :
( ( identity(X37,X38)
| ~ apply(X37,esk7_2(X37,X38),esk7_2(X37,X38)) )
& ( identity(X37,X38)
| member(esk7_2(X37,X38),X38) )
& ( apply(X34,X36,X36)
| ~ member(X36,X35)
| ~ identity(X34,X35) ) ),
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)],[identity])])])])])])]) ).
fof(c_0_10,negated_conjecture,
( ~ surjective(esk2_0,esk3_0,esk4_0)
& identity(compose_function(esk2_0,esk1_0,esk4_0,esk3_0,esk4_0),esk4_0)
& maps(esk1_0,esk4_0,esk3_0)
& maps(esk2_0,esk3_0,esk4_0) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])])]) ).
cnf(c_0_11,plain,
( ~ member(X8,X5)
| ~ member(esk6_3(X1,X2,X3),X7)
| ~ member(esk8_7(X1,X4,X5,X6,X7,X8,esk6_3(X1,X2,X3)),X2)
| ~ apply(compose_function(X1,X4,X5,X6,X7),X8,esk6_3(X1,X2,X3))
| surjective(X1,X2,X3) ),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_12,plain,
( ~ member(X7,X5)
| ~ member(X6,X3)
| ~ apply(compose_function(X1,X2,X3,X4,X5),X6,X7)
| member(esk8_7(X1,X2,X3,X4,X5,X6,X7),X4) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_13,plain,
( ~ member(X3,X2)
| ~ identity(X1,X2)
| apply(X1,X3,X3) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_14,negated_conjecture,
identity(compose_function(esk2_0,esk1_0,esk4_0,esk3_0,esk4_0),esk4_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_15,plain,
( ~ member(X7,X5)
| ~ member(esk6_3(X1,X2,X3),X6)
| ~ apply(compose_function(X1,X4,X5,X2,X6),X7,esk6_3(X1,X2,X3))
| surjective(X1,X2,X3) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_16,negated_conjecture,
( ~ member(X1,esk4_0)
| apply(compose_function(esk2_0,esk1_0,esk4_0,esk3_0,esk4_0),X1,X1) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_17,negated_conjecture,
( ~ member(esk6_3(esk2_0,esk3_0,X1),esk4_0)
| surjective(esk2_0,esk3_0,X1) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_18,plain,
( surjective(X1,X2,X3)
| member(esk6_3(X1,X2,X3),X3) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_19,negated_conjecture,
~ surjective(esk2_0,esk3_0,esk4_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_20,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : SET734+4 : TPTP v9.3.1. Bugfixed v2.2.1.
% 0.00/0.08 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.20/5.50 % Computer : n006.cluster.edu
% 0.20/5.50 % Model : x86_64 x86_64
% 0.20/5.50 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.20/5.50 % Memory : 8046.5625MB
% 0.20/5.50 % OS : Linux 6.8.0-71-generic
% 0.20/5.50 % CPULimit : 300
% 0.20/5.50 % WCLimit : 300
% 0.20/5.50 % DateTime : Mon Sep 21 05:35:02 UTC 2026
% 0.20/5.51 % CPUTime :
% 0.20/5.51 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.20/5.58 Running first-order theorem proving
% 0.20/5.58 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.25/5.66 % Version: 3.5.1
% 0.25/5.66 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.25/5.66 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.25/5.66 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.25/5.66 % Starting new_bool_3 with 300s (1) cores
% 0.25/5.66 % Starting new_bool_1 with 300s (1) cores
% 0.25/5.66 % Starting sh5l with 300s (1) cores
% 0.25/5.66 % new_bool_3 with pid 2102920 completed with status 0
% 0.25/5.66 % Result found by new_bool_3
% 0.25/5.66 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.25/5.66 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.25/5.66 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.25/5.66 % Starting new_bool_3 with 300s (1) cores
% 0.25/5.66 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.25/5.66 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.25/5.66 % Search class: FGUSF-FFMS33-SFFFFFNN
% 0.25/5.66 % partial match(1): FGUSS-FFMS33-SFFFFFNN
% 0.25/5.66 % Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.25/5.66 % Starting SubtermCWHack with 31s (1) cores
% 0.25/5.66 % SubtermCWHack with pid 2102928 completed with status 0
% 0.25/5.66 % Result found by SubtermCWHack
% 0.25/5.66 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.25/5.66 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.25/5.66 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.25/5.66 % Starting new_bool_3 with 300s (1) cores
% 0.25/5.66 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.25/5.66 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.25/5.66 % Search class: FGUSF-FFMS33-SFFFFFNN
% 0.25/5.66 % partial match(1): FGUSS-FFMS33-SFFFFFNN
% 0.25/5.66 % Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.25/5.66 % Starting SubtermCWHack with 31s (1) cores
% 0.25/5.66 % Preprocessing time : 0.003 s
% 0.25/5.66
% 0.25/5.66 % Proof found!
% 0.25/5.66 % SZS status Theorem
% 0.25/5.66 % SZS output start CNFRefutation
% See solution above
% 0.25/5.66 % Parsed axioms : 29
% 0.25/5.66 % Removed by relevancy pruning/SinE : 22
% 0.25/5.66 % Initial clauses : 40
% 0.25/5.66 % Removed in clause preprocessing : 0
% 0.25/5.66 % Initial clauses in saturation : 40
% 0.25/5.66 % Processed clauses : 75
% 0.25/5.66 % ...of these trivial : 0
% 0.25/5.66 % ...subsumed : 0
% 0.25/5.66 % ...remaining for further processing : 75
% 0.25/5.66 % Other redundant clauses eliminated : 0
% 0.25/5.66 % Clauses deleted for lack of memory : 0
% 0.25/5.66 % Backward-subsumed : 0
% 0.25/5.66 % Backward-rewritten : 0
% 0.25/5.66 % Generated clauses : 156
% 0.25/5.66 % ...of the previous two non-redundant : 139
% 0.25/5.66 % ...aggressively subsumed : 0
% 0.25/5.66 % Contextual simplify-reflections : 0
% 0.25/5.66 % Paramodulations : 156
% 0.25/5.66 % Factorizations : 0
% 0.25/5.66 % NegExts : 0
% 0.25/5.66 % Equation resolutions : 0
% 0.25/5.66 % Disequality decompositions : 0
% 0.25/5.66 % Total rewrite steps : 1
% 0.25/5.66 % ...of those cached : 0
% 0.25/5.66 % Propositional unsat checks : 0
% 0.25/5.66 % Propositional check models : 0
% 0.25/5.66 % Propositional check unsatisfiable : 0
% 0.25/5.66 % Propositional clauses : 0
% 0.25/5.66 % Propositional clauses after purity: 0
% 0.25/5.66 % Propositional unsat core size : 0
% 0.25/5.66 % Propositional preprocessing time : 0.000
% 0.25/5.66 % Propositional encoding time : 0.000
% 0.25/5.66 % Propositional solver time : 0.000
% 0.25/5.66 % Success case prop preproc time : 0.000
% 0.25/5.66 % Success case prop encoding time : 0.000
% 0.25/5.66 % Success case prop solver time : 0.000
% 0.25/5.66 % Current number of processed clauses : 75
% 0.25/5.66 % Positive orientable unit clauses : 4
% 0.25/5.66 % Positive unorientable unit clauses: 0
% 0.25/5.66 % Negative unit clauses : 1
% 0.25/5.66 % Non-unit-clauses : 70
% 0.25/5.66 % Current number of unprocessed clauses: 104
% 0.25/5.66 % ...number of literals in the above : 890
% 0.25/5.66 % Current number of archived formulas : 0
% 0.25/5.66 % Current number of archived clauses : 0
% 0.25/5.66 % Clause-clause subsumption calls (NU) : 1138
% 0.25/5.66 % Rec. Clause-clause subsumption calls : 298
% 0.25/5.66 % Non-unit clause-clause subsumptions : 0
% 0.25/5.66 % Unit Clause-clause subsumption calls : 0
% 0.25/5.66 % Rewrite failures with RHS unbound : 0
% 0.25/5.66 % BW rewrite match attempts : 0
% 0.25/5.66 % BW rewrite match successes : 0
% 0.25/5.66 % Condensation attempts : 0
% 0.25/5.66 % Condensation successes : 0
% 0.25/5.66 % Termbank termtop insertions : 8124
% 0.25/5.66 % Search garbage collected termcells : 1110
% 0.25/5.66
% 0.25/5.66 % -------------------------------------------------
% 0.25/5.66 % User time : 0.022 s
% 0.25/5.66 % System time : 0.008 s
% 0.25/5.66 % Total time : 0.030 s
% 0.25/5.66 % Maximum resident set size: 3640 pages
% 0.25/5.66
% 0.25/5.66 % -------------------------------------------------
% 0.25/5.66 % User time : 0.026 s
% 0.25/5.66 % System time : 0.014 s
% 0.25/5.66 % Total time : 0.040 s
% 0.25/5.66 % Maximum resident set size: 4864 pages
% 0.25/5.66 % E exiting
%------------------------------------------------------------------------------