%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SET722+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 : n002.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:04 PM UTC 2026
% Result : Theorem 0.26s 0.54s
% Output : CNFRefutation 0.26s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 3
% Syntax : Number of formulae : 21 ( 3 unt; 0 def)
% Number of atoms : 93 ( 0 equ)
% Maximal formula atoms : 18 ( 4 avg)
% Number of connectives : 122 ( 50 ~; 49 |; 17 &)
% ( 2 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 18 ( 6 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-3 aty)
% Number of functors : 9 ( 9 usr; 5 con; 0-7 aty)
% Number of variables : 99 ( 2 sgn 37 !; 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(thII13,conjecture,
! [X6,X10,X1,X2,X11] :
( ( surjective(compose_function(X10,X6,X1,X2,X11),X1,X11)
& maps(X10,X2,X11)
& maps(X6,X1,X2) )
=> surjective(X10,X2,X11) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',thII13) ).
fof(c_0_3,plain,
! [X22,X23,X24,X25,X27,X28,X29,X31] :
( ( surjective(X27,X28,X29)
| ~ apply(X27,X31,esk7_3(X27,X28,X29))
| ~ member(X31,X28) )
& ( surjective(X27,X28,X29)
| member(esk7_3(X27,X28,X29),X29) )
& ( ~ surjective(X22,X23,X24)
| ~ member(X25,X24)
| apply(X22,esk6_4(X22,X23,X24,X25),X25) )
& ( ~ surjective(X22,X23,X24)
| ~ member(X25,X24)
| member(esk6_4(X22,X23,X24,X25),X23) ) ),
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_4,plain,
! [X35,X36,X37,X38,X39,X40,X41,X43] :
( ( ~ member(X41,X39)
| ~ member(X40,X37)
| apply(compose_function(X35,X36,X37,X38,X39),X40,X41)
| ~ apply(X35,X43,X41)
| ~ apply(X36,X40,X43)
| ~ member(X43,X38) )
& ( ~ member(X41,X39)
| ~ member(X40,X37)
| ~ apply(compose_function(X35,X36,X37,X38,X39),X40,X41)
| apply(X35,esk8_7(X35,X36,X37,X38,X39,X40,X41),X41) )
& ( ~ member(X41,X39)
| ~ member(X40,X37)
| ~ apply(compose_function(X35,X36,X37,X38,X39),X40,X41)
| apply(X36,X40,esk8_7(X35,X36,X37,X38,X39,X40,X41)) )
& ( ~ member(X41,X39)
| ~ member(X40,X37)
| ~ apply(compose_function(X35,X36,X37,X38,X39),X40,X41)
| member(esk8_7(X35,X36,X37,X38,X39,X40,X41),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(fof_nnf,[status(thm)],[compose_function])])])])])]) ).
cnf(c_0_5,plain,
( ~ apply(X3,X1,esk7_3(X3,X2,X4))
| ~ member(X1,X2)
| surjective(X3,X2,X4) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_6,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_4]) ).
cnf(c_0_7,plain,
( ~ member(X8,X5)
| ~ member(esk7_3(X1,X2,X3),X7)
| ~ member(esk8_7(X1,X4,X5,X6,X7,X8,esk7_3(X1,X2,X3)),X2)
| ~ apply(compose_function(X1,X4,X5,X6,X7),X8,esk7_3(X1,X2,X3))
| surjective(X1,X2,X3) ),
inference(spm,[status(thm)],[c_0_5,c_0_6]) ).
cnf(c_0_8,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_4]) ).
cnf(c_0_9,plain,
( ~ member(X7,X5)
| ~ member(esk7_3(X1,X2,X3),X6)
| ~ apply(compose_function(X1,X4,X5,X2,X6),X7,esk7_3(X1,X2,X3))
| surjective(X1,X2,X3) ),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_10,plain,
( ~ surjective(X1,X2,X3)
| ~ member(X4,X3)
| apply(X1,esk6_4(X1,X2,X3,X4),X4) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
fof(c_0_11,negated_conjecture,
~ ! [X6,X10,X1,X2,X11] :
( ( surjective(compose_function(X10,X6,X1,X2,X11),X1,X11)
& maps(X10,X2,X11)
& maps(X6,X1,X2) )
=> surjective(X10,X2,X11) ),
inference(assume_negation,[status(cth)],[thII13]) ).
cnf(c_0_12,plain,
( ~ member(esk7_3(X1,X2,X3),X8)
| ~ member(esk7_3(X1,X2,X3),X6)
| ~ member(esk6_4(compose_function(X1,X4,X5,X2,X6),X7,X8,esk7_3(X1,X2,X3)),X5)
| ~ surjective(compose_function(X1,X4,X5,X2,X6),X7,X8)
| surjective(X1,X2,X3) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_13,plain,
( ~ surjective(X1,X2,X3)
| ~ member(X4,X3)
| member(esk6_4(X1,X2,X3,X4),X2) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
fof(c_0_14,negated_conjecture,
( ~ surjective(esk2_0,esk4_0,esk5_0)
& surjective(compose_function(esk2_0,esk1_0,esk3_0,esk4_0,esk5_0),esk3_0,esk5_0)
& maps(esk2_0,esk4_0,esk5_0)
& maps(esk1_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_11])])])]) ).
cnf(c_0_15,plain,
( ~ member(esk7_3(X1,X2,X3),X7)
| ~ member(esk7_3(X1,X2,X3),X6)
| ~ surjective(compose_function(X1,X4,X5,X2,X6),X5,X7)
| surjective(X1,X2,X3) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_16,negated_conjecture,
surjective(compose_function(esk2_0,esk1_0,esk3_0,esk4_0,esk5_0),esk3_0,esk5_0),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_17,negated_conjecture,
( ~ member(esk7_3(esk2_0,esk4_0,X1),esk5_0)
| surjective(esk2_0,esk4_0,X1) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_18,plain,
( surjective(X1,X2,X3)
| member(esk7_3(X1,X2,X3),X3) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_19,negated_conjecture,
~ surjective(esk2_0,esk4_0,esk5_0),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
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.03 % Problem : SET722+4 : TPTP v9.3.1. Bugfixed v2.2.1.
% 0.00/0.06 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.17/0.42 % Computer : n002.cluster.edu
% 0.17/0.42 % Model : x86_64 x86_64
% 0.17/0.42 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.42 % Memory : 8046.5625MB
% 0.17/0.42 % OS : Linux 6.8.0-71-generic
% 0.17/0.42 % CPULimit : 300
% 0.17/0.42 % WCLimit : 300
% 0.17/0.42 % DateTime : Mon Sep 21 05:36:32 UTC 2026
% 0.17/0.42 % CPUTime :
% 0.17/0.42 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.17/0.49 Running first-order theorem proving
% 0.17/0.49 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.26/0.54 % Version: 3.5.1
% 0.26/0.54 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.26/0.54 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.26/0.54 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.26/0.54 % Starting new_bool_3 with 300s (1) cores
% 0.26/0.54 % Starting new_bool_1 with 300s (1) cores
% 0.26/0.54 % Starting sh5l with 300s (1) cores
% 0.26/0.54 % new_bool_1 with pid 2534923 completed with status 0
% 0.26/0.54 % Result found by new_bool_1
% 0.26/0.54 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.26/0.54 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.26/0.54 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.26/0.54 % Starting new_bool_3 with 300s (1) cores
% 0.26/0.54 % Starting new_bool_1 with 300s (1) cores
% 0.26/0.54 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.26/0.54 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.26/0.54 % Search class: FGUSF-FFMS33-SFFFFFNN
% 0.26/0.54 % partial match(1): FGUSS-FFMS33-SFFFFFNN
% 0.26/0.54 % Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.26/0.54 % Starting SubtermCWHack with 31s (1) cores
% 0.26/0.54 % SubtermCWHack with pid 2534926 completed with status 0
% 0.26/0.54 % Result found by SubtermCWHack
% 0.26/0.54 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.26/0.54 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.26/0.54 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.26/0.54 % Starting new_bool_3 with 300s (1) cores
% 0.26/0.54 % Starting new_bool_1 with 300s (1) cores
% 0.26/0.54 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.26/0.54 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.26/0.54 % Search class: FGUSF-FFMS33-SFFFFFNN
% 0.26/0.54 % partial match(1): FGUSS-FFMS33-SFFFFFNN
% 0.26/0.54 % Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.26/0.54 % Starting SubtermCWHack with 31s (1) cores
% 0.26/0.54 % Preprocessing time : 0.002 s
% 0.26/0.54
% 0.26/0.54 % Proof found!
% 0.26/0.54 % SZS status Theorem
% 0.26/0.54 % SZS output start CNFRefutation
% See solution above
% 0.26/0.54 % Parsed axioms : 29
% 0.26/0.54 % Removed by relevancy pruning/SinE : 23
% 0.26/0.54 % Initial clauses : 37
% 0.26/0.54 % Removed in clause preprocessing : 0
% 0.26/0.54 % Initial clauses in saturation : 37
% 0.26/0.54 % Processed clauses : 87
% 0.26/0.54 % ...of these trivial : 0
% 0.26/0.54 % ...subsumed : 16
% 0.26/0.54 % ...remaining for further processing : 71
% 0.26/0.54 % Other redundant clauses eliminated : 0
% 0.26/0.54 % Clauses deleted for lack of memory : 0
% 0.26/0.54 % Backward-subsumed : 0
% 0.26/0.54 % Backward-rewritten : 0
% 0.26/0.54 % Generated clauses : 178
% 0.26/0.54 % ...of the previous two non-redundant : 162
% 0.26/0.54 % ...aggressively subsumed : 0
% 0.26/0.54 % Contextual simplify-reflections : 0
% 0.26/0.54 % Paramodulations : 178
% 0.26/0.54 % Factorizations : 0
% 0.26/0.54 % NegExts : 0
% 0.26/0.54 % Equation resolutions : 0
% 0.26/0.54 % Disequality decompositions : 0
% 0.26/0.54 % Total rewrite steps : 0
% 0.26/0.54 % ...of those cached : 0
% 0.26/0.54 % Propositional unsat checks : 0
% 0.26/0.54 % Propositional check models : 0
% 0.26/0.54 % Propositional check unsatisfiable : 0
% 0.26/0.54 % Propositional clauses : 0
% 0.26/0.54 % Propositional clauses after purity: 0
% 0.26/0.54 % Propositional unsat core size : 0
% 0.26/0.54 % Propositional preprocessing time : 0.000
% 0.26/0.54 % Propositional encoding time : 0.000
% 0.26/0.54 % Propositional solver time : 0.000
% 0.26/0.54 % Success case prop preproc time : 0.000
% 0.26/0.54 % Success case prop encoding time : 0.000
% 0.26/0.54 % Success case prop solver time : 0.000
% 0.26/0.54 % Current number of processed clauses : 71
% 0.26/0.54 % Positive orientable unit clauses : 3
% 0.26/0.54 % Positive unorientable unit clauses: 0
% 0.26/0.54 % Negative unit clauses : 1
% 0.26/0.54 % Non-unit-clauses : 67
% 0.26/0.54 % Current number of unprocessed clauses: 112
% 0.26/0.54 % ...number of literals in the above : 1016
% 0.26/0.54 % Current number of archived formulas : 0
% 0.26/0.54 % Current number of archived clauses : 0
% 0.26/0.54 % Clause-clause subsumption calls (NU) : 1094
% 0.26/0.54 % Rec. Clause-clause subsumption calls : 246
% 0.26/0.54 % Non-unit clause-clause subsumptions : 16
% 0.26/0.54 % Unit Clause-clause subsumption calls : 0
% 0.26/0.54 % Rewrite failures with RHS unbound : 0
% 0.26/0.54 % BW rewrite match attempts : 0
% 0.26/0.54 % BW rewrite match successes : 0
% 0.26/0.54 % Condensation attempts : 0
% 0.26/0.54 % Condensation successes : 0
% 0.26/0.54 % Termbank termtop insertions : 8088
% 0.26/0.54 % Search garbage collected termcells : 1048
% 0.26/0.54
% 0.26/0.54 % -------------------------------------------------
% 0.26/0.54 % User time : 0.020 s
% 0.26/0.54 % System time : 0.007 s
% 0.26/0.54 % Total time : 0.027 s
% 0.26/0.54 % Maximum resident set size: 3692 pages
% 0.26/0.54
% 0.26/0.54 % -------------------------------------------------
% 0.26/0.54 % User time : 0.023 s
% 0.26/0.54 % System time : 0.014 s
% 0.26/0.54 % Total time : 0.038 s
% 0.26/0.54 % Maximum resident set size: 4608 pages
% 0.26/0.54 % E exiting
%------------------------------------------------------------------------------