TSTP Solution File: SET717+4 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SET717+4 : TPTP v8.1.0. Bugfixed v2.2.1.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n018.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 600s
% DateTime : Tue Jul 19 00:53:21 EDT 2022
% Result : Theorem 0.23s 1.42s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 3
% Syntax : Number of formulae : 30 ( 4 unt; 0 def)
% Number of atoms : 113 ( 0 equ)
% Maximal formula atoms : 18 ( 3 avg)
% Number of connectives : 132 ( 49 ~; 57 |; 20 &)
% ( 2 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 18 ( 5 avg)
% Maximal term depth : 5 ( 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 : 97 ( 3 sgn 37 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(thII08,conjecture,
! [X6,X10,X1,X2,X11] :
( ( maps(X6,X1,X2)
& maps(X10,X2,X11)
& surjective(X6,X1,X2)
& surjective(X10,X2,X11) )
=> surjective(compose_function(X10,X6,X1,X2,X11),X1,X11) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p',thII08) ).
fof(surjective,axiom,
! [X6,X1,X2] :
( surjective(X6,X1,X2)
<=> ! [X5] :
( member(X5,X2)
=> ? [X4] :
( member(X4,X1)
& apply(X6,X4,X5) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET006+1.ax',surjective) ).
fof(compose_function,axiom,
! [X10,X6,X1,X2,X11,X3,X12] :
( ( member(X3,X1)
& member(X12,X11) )
=> ( apply(compose_function(X10,X6,X1,X2,X11),X3,X12)
<=> ? [X5] :
( member(X5,X2)
& apply(X6,X3,X5)
& apply(X10,X5,X12) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SET006+1.ax',compose_function) ).
fof(c_0_3,negated_conjecture,
~ ! [X6,X10,X1,X2,X11] :
( ( maps(X6,X1,X2)
& maps(X10,X2,X11)
& surjective(X6,X1,X2)
& surjective(X10,X2,X11) )
=> surjective(compose_function(X10,X6,X1,X2,X11),X1,X11) ),
inference(assume_negation,[status(cth)],[thII08]) ).
fof(c_0_4,plain,
! [X7,X8,X9,X10,X7,X8,X9,X13] :
( ( member(esk6_4(X7,X8,X9,X10),X8)
| ~ member(X10,X9)
| ~ surjective(X7,X8,X9) )
& ( apply(X7,esk6_4(X7,X8,X9,X10),X10)
| ~ member(X10,X9)
| ~ surjective(X7,X8,X9) )
& ( member(esk7_3(X7,X8,X9),X9)
| surjective(X7,X8,X9) )
& ( ~ member(X13,X8)
| ~ apply(X7,X13,esk7_3(X7,X8,X9))
| surjective(X7,X8,X9) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[surjective])])])])])])]) ).
fof(c_0_5,negated_conjecture,
( maps(esk1_0,esk3_0,esk4_0)
& maps(esk2_0,esk4_0,esk5_0)
& surjective(esk1_0,esk3_0,esk4_0)
& surjective(esk2_0,esk4_0,esk5_0)
& ~ surjective(compose_function(esk2_0,esk1_0,esk3_0,esk4_0,esk5_0),esk3_0,esk5_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])]) ).
cnf(c_0_6,plain,
( member(esk6_4(X1,X2,X3,X4),X2)
| ~ surjective(X1,X2,X3)
| ~ member(X4,X3) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,negated_conjecture,
surjective(esk2_0,esk4_0,esk5_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_8,plain,
( apply(X1,esk6_4(X1,X2,X3,X4),X4)
| ~ surjective(X1,X2,X3)
| ~ member(X4,X3) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_9,negated_conjecture,
surjective(esk1_0,esk3_0,esk4_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_10,negated_conjecture,
( member(esk6_4(esk2_0,esk4_0,esk5_0,X1),esk4_0)
| ~ member(X1,esk5_0) ),
inference(spm,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_11,plain,
( surjective(X1,X2,X3)
| member(esk7_3(X1,X2,X3),X3) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
fof(c_0_12,plain,
! [X13,X14,X15,X16,X17,X18,X19,X21] :
( ( member(esk8_7(X13,X14,X15,X16,X17,X18,X19),X16)
| ~ apply(compose_function(X13,X14,X15,X16,X17),X18,X19)
| ~ member(X18,X15)
| ~ member(X19,X17) )
& ( apply(X14,X18,esk8_7(X13,X14,X15,X16,X17,X18,X19))
| ~ apply(compose_function(X13,X14,X15,X16,X17),X18,X19)
| ~ member(X18,X15)
| ~ member(X19,X17) )
& ( apply(X13,esk8_7(X13,X14,X15,X16,X17,X18,X19),X19)
| ~ apply(compose_function(X13,X14,X15,X16,X17),X18,X19)
| ~ member(X18,X15)
| ~ member(X19,X17) )
& ( ~ member(X21,X16)
| ~ apply(X14,X18,X21)
| ~ apply(X13,X21,X19)
| apply(compose_function(X13,X14,X15,X16,X17),X18,X19)
| ~ member(X18,X15)
| ~ member(X19,X17) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[compose_function])])])])])])]) ).
cnf(c_0_13,negated_conjecture,
( apply(esk1_0,esk6_4(esk1_0,esk3_0,esk4_0,X1),X1)
| ~ member(X1,esk4_0) ),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_14,negated_conjecture,
( surjective(X1,X2,esk5_0)
| member(esk6_4(esk2_0,esk4_0,esk5_0,esk7_3(X1,X2,esk5_0)),esk4_0) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_15,plain,
( apply(compose_function(X5,X6,X4,X7,X2),X3,X1)
| ~ member(X1,X2)
| ~ member(X3,X4)
| ~ apply(X5,X8,X1)
| ~ apply(X6,X3,X8)
| ~ member(X8,X7) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_16,negated_conjecture,
( surjective(X1,X2,esk5_0)
| apply(esk1_0,esk6_4(esk1_0,esk3_0,esk4_0,esk6_4(esk2_0,esk4_0,esk5_0,esk7_3(X1,X2,esk5_0))),esk6_4(esk2_0,esk4_0,esk5_0,esk7_3(X1,X2,esk5_0))) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_17,negated_conjecture,
( member(esk6_4(esk1_0,esk3_0,esk4_0,X1),esk3_0)
| ~ member(X1,esk4_0) ),
inference(spm,[status(thm)],[c_0_6,c_0_9]) ).
cnf(c_0_18,negated_conjecture,
( surjective(X1,X2,esk5_0)
| apply(compose_function(X3,esk1_0,X4,X5,X6),esk6_4(esk1_0,esk3_0,esk4_0,esk6_4(esk2_0,esk4_0,esk5_0,esk7_3(X1,X2,esk5_0))),X7)
| ~ apply(X3,esk6_4(esk2_0,esk4_0,esk5_0,esk7_3(X1,X2,esk5_0)),X7)
| ~ member(esk6_4(esk1_0,esk3_0,esk4_0,esk6_4(esk2_0,esk4_0,esk5_0,esk7_3(X1,X2,esk5_0))),X4)
| ~ member(esk6_4(esk2_0,esk4_0,esk5_0,esk7_3(X1,X2,esk5_0)),X5)
| ~ member(X7,X6) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_19,negated_conjecture,
( surjective(X1,X2,esk5_0)
| member(esk6_4(esk1_0,esk3_0,esk4_0,esk6_4(esk2_0,esk4_0,esk5_0,esk7_3(X1,X2,esk5_0))),esk3_0) ),
inference(spm,[status(thm)],[c_0_17,c_0_14]) ).
cnf(c_0_20,negated_conjecture,
( apply(esk2_0,esk6_4(esk2_0,esk4_0,esk5_0,X1),X1)
| ~ member(X1,esk5_0) ),
inference(spm,[status(thm)],[c_0_8,c_0_7]) ).
cnf(c_0_21,negated_conjecture,
( surjective(X1,X2,esk5_0)
| apply(compose_function(X3,esk1_0,esk3_0,X4,X5),esk6_4(esk1_0,esk3_0,esk4_0,esk6_4(esk2_0,esk4_0,esk5_0,esk7_3(X1,X2,esk5_0))),X6)
| ~ apply(X3,esk6_4(esk2_0,esk4_0,esk5_0,esk7_3(X1,X2,esk5_0)),X6)
| ~ member(esk6_4(esk2_0,esk4_0,esk5_0,esk7_3(X1,X2,esk5_0)),X4)
| ~ member(X6,X5) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_22,negated_conjecture,
( surjective(X1,X2,esk5_0)
| apply(esk2_0,esk6_4(esk2_0,esk4_0,esk5_0,esk7_3(X1,X2,esk5_0)),esk7_3(X1,X2,esk5_0)) ),
inference(spm,[status(thm)],[c_0_20,c_0_11]) ).
cnf(c_0_23,negated_conjecture,
( surjective(X1,X2,esk5_0)
| apply(compose_function(esk2_0,esk1_0,esk3_0,X3,X4),esk6_4(esk1_0,esk3_0,esk4_0,esk6_4(esk2_0,esk4_0,esk5_0,esk7_3(X1,X2,esk5_0))),esk7_3(X1,X2,esk5_0))
| ~ member(esk6_4(esk2_0,esk4_0,esk5_0,esk7_3(X1,X2,esk5_0)),X3)
| ~ member(esk7_3(X1,X2,esk5_0),X4) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_24,negated_conjecture,
( surjective(X1,X2,esk5_0)
| apply(compose_function(esk2_0,esk1_0,esk3_0,esk4_0,X3),esk6_4(esk1_0,esk3_0,esk4_0,esk6_4(esk2_0,esk4_0,esk5_0,esk7_3(X1,X2,esk5_0))),esk7_3(X1,X2,esk5_0))
| ~ member(esk7_3(X1,X2,esk5_0),X3) ),
inference(spm,[status(thm)],[c_0_23,c_0_14]) ).
cnf(c_0_25,plain,
( surjective(X1,X2,X3)
| ~ apply(X1,X4,esk7_3(X1,X2,X3))
| ~ member(X4,X2) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_26,negated_conjecture,
( surjective(X1,X2,esk5_0)
| apply(compose_function(esk2_0,esk1_0,esk3_0,esk4_0,esk5_0),esk6_4(esk1_0,esk3_0,esk4_0,esk6_4(esk2_0,esk4_0,esk5_0,esk7_3(X1,X2,esk5_0))),esk7_3(X1,X2,esk5_0)) ),
inference(spm,[status(thm)],[c_0_24,c_0_11]) ).
cnf(c_0_27,negated_conjecture,
( surjective(compose_function(esk2_0,esk1_0,esk3_0,esk4_0,esk5_0),X1,esk5_0)
| ~ member(esk6_4(esk1_0,esk3_0,esk4_0,esk6_4(esk2_0,esk4_0,esk5_0,esk7_3(compose_function(esk2_0,esk1_0,esk3_0,esk4_0,esk5_0),X1,esk5_0))),X1) ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_28,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_5]) ).
cnf(c_0_29,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_19]),c_0_28]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SET717+4 : TPTP v8.1.0. Bugfixed v2.2.1.
% 0.03/0.13 % Command : run_ET %s %d
% 0.12/0.34 % Computer : n018.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Mon Jul 11 05:03:13 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.23/1.42 # Running protocol protocol_eprover_2d86bd69119e7e9cc4417c0ee581499eaf828bb2 for 23 seconds:
% 0.23/1.42 # SinE strategy is GSinE(CountFormulas,,1.1,,02,500,1.0)
% 0.23/1.42 # Preprocessing time : 0.016 s
% 0.23/1.42
% 0.23/1.42 # Proof found!
% 0.23/1.42 # SZS status Theorem
% 0.23/1.42 # SZS output start CNFRefutation
% See solution above
% 0.23/1.42 # Proof object total steps : 30
% 0.23/1.42 # Proof object clause steps : 23
% 0.23/1.42 # Proof object formula steps : 7
% 0.23/1.42 # Proof object conjectures : 21
% 0.23/1.42 # Proof object clause conjectures : 18
% 0.23/1.42 # Proof object formula conjectures : 3
% 0.23/1.42 # Proof object initial clauses used : 8
% 0.23/1.42 # Proof object initial formulas used : 3
% 0.23/1.42 # Proof object generating inferences : 15
% 0.23/1.42 # Proof object simplifying inferences : 1
% 0.23/1.42 # Training examples: 0 positive, 0 negative
% 0.23/1.42 # Parsed axioms : 29
% 0.23/1.42 # Removed by relevancy pruning/SinE : 25
% 0.23/1.42 # Initial clauses : 28
% 0.23/1.42 # Removed in clause preprocessing : 0
% 0.23/1.42 # Initial clauses in saturation : 28
% 0.23/1.42 # Processed clauses : 1823
% 0.23/1.42 # ...of these trivial : 0
% 0.23/1.42 # ...subsumed : 600
% 0.23/1.42 # ...remaining for further processing : 1223
% 0.23/1.42 # Other redundant clauses eliminated : 0
% 0.23/1.42 # Clauses deleted for lack of memory : 0
% 0.23/1.42 # Backward-subsumed : 25
% 0.23/1.42 # Backward-rewritten : 0
% 0.23/1.42 # Generated clauses : 3863
% 0.23/1.42 # ...of the previous two non-trivial : 3855
% 0.23/1.42 # Contextual simplify-reflections : 45
% 0.23/1.42 # Paramodulations : 3863
% 0.23/1.42 # Factorizations : 0
% 0.23/1.42 # Equation resolutions : 0
% 0.23/1.42 # Current number of processed clauses : 1198
% 0.23/1.42 # Positive orientable unit clauses : 4
% 0.23/1.42 # Positive unorientable unit clauses: 0
% 0.23/1.42 # Negative unit clauses : 1
% 0.23/1.42 # Non-unit-clauses : 1193
% 0.23/1.42 # Current number of unprocessed clauses: 2060
% 0.23/1.42 # ...number of literals in the above : 6953
% 0.23/1.42 # Current number of archived formulas : 0
% 0.23/1.42 # Current number of archived clauses : 25
% 0.23/1.42 # Clause-clause subsumption calls (NU) : 302172
% 0.23/1.42 # Rec. Clause-clause subsumption calls : 270903
% 0.23/1.42 # Non-unit clause-clause subsumptions : 670
% 0.23/1.42 # Unit Clause-clause subsumption calls : 0
% 0.23/1.42 # Rewrite failures with RHS unbound : 0
% 0.23/1.42 # BW rewrite match attempts : 0
% 0.23/1.42 # BW rewrite match successes : 0
% 0.23/1.42 # Condensation attempts : 0
% 0.23/1.42 # Condensation successes : 0
% 0.23/1.42 # Termbank termtop insertions : 326369
% 0.23/1.42
% 0.23/1.42 # -------------------------------------------------
% 0.23/1.42 # User time : 0.300 s
% 0.23/1.42 # System time : 0.007 s
% 0.23/1.42 # Total time : 0.307 s
% 0.23/1.42 # Maximum resident set size: 10448 pages
% 0.23/23.42 eprover: CPU time limit exceeded, terminating
% 0.23/23.43 eprover: CPU time limit exceeded, terminating
% 0.23/23.44 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.23/23.44 eprover: No such file or directory
% 0.23/23.44 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.23/23.44 eprover: No such file or directory
% 0.23/23.44 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.23/23.44 eprover: No such file or directory
% 0.23/23.45 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.23/23.45 eprover: No such file or directory
% 0.23/23.45 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.23/23.45 eprover: No such file or directory
% 0.23/23.45 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.23/23.45 eprover: No such file or directory
% 0.23/23.45 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.23/23.45 eprover: No such file or directory
% 0.23/23.45 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.23/23.45 eprover: No such file or directory
% 0.23/23.46 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.23/23.46 eprover: No such file or directory
% 0.23/23.46 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.23/23.46 eprover: No such file or directory
% 0.23/23.46 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.23/23.46 eprover: No such file or directory
% 0.23/23.46 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.23/23.46 eprover: No such file or directory
% 0.23/23.47 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.23/23.47 eprover: No such file or directory
% 0.23/23.47 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.23/23.47 eprover: No such file or directory
% 0.23/23.47 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.23/23.47 eprover: eprover: No such file or directory
% 0.23/23.47 Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.23/23.47 eprover: No such file or directory
% 0.23/23.48 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.23/23.48 eprover: No such file or directory
% 0.23/23.48 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.23/23.48 eprover: No such file or directory
% 0.23/23.48 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.23/23.48 eprover: No such file or directory
% 0.23/23.49 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.23/23.49 eprover: No such file or directory
% 0.23/23.50 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.23/23.50 eprover: No such file or directory
% 0.23/23.50 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.23/23.50 eprover: No such file or directory
%------------------------------------------------------------------------------