TSTP Solution File: NUN059+2 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : NUN059+2 : TPTP v8.1.0. Bugfixed v7.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n020.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 : Mon Jul 18 16:26:01 EDT 2022
% Result : Theorem 0.21s 1.40s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 4
% Syntax : Number of formulae : 30 ( 16 unt; 0 def)
% Number of atoms : 73 ( 20 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 71 ( 28 ~; 20 |; 23 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 6 ( 6 usr; 1 con; 0-1 aty)
% Number of variables : 68 ( 8 sgn 13 !; 20 ?)
% Comments :
%------------------------------------------------------------------------------
fof(axiom_5a,axiom,
! [X33] :
? [X34] :
( ? [X35] :
( r1(X35)
& r4(X33,X35,X34) )
& ? [X36] :
( r1(X36)
& X34 = X36 ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/NUM008+0.ax',axiom_5a) ).
fof(fermattothepoweroftwo,conjecture,
? [X39,X23,X22,X16] :
( ? [X17] :
( r4(X22,X22,X17)
& X16 = X17 )
& ? [X25] :
( r4(X23,X23,X25)
& ? [X19] :
( r4(X39,X39,X19)
& r3(X19,X25,X16) ) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',fermattothepoweroftwo) ).
fof(axiom_1,axiom,
? [X1] :
! [X2] :
( ( ~ r1(X2)
& X2 != X1 )
| ( r1(X2)
& X2 = X1 ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/NUM008+0.ax',axiom_1) ).
fof(axiom_4a,axiom,
! [X30] :
? [X31] :
( ? [X32] :
( r1(X32)
& r3(X30,X32,X31) )
& X31 = X30 ),
file('/export/starexec/sandbox2/benchmark/Axioms/NUM008+0.ax',axiom_4a) ).
fof(c_0_4,plain,
! [X37] :
( r1(esk14_1(X37))
& r4(X37,esk14_1(X37),esk13_1(X37))
& r1(esk15_1(X37))
& esk13_1(X37) = esk15_1(X37) ),
inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[axiom_5a])])])]) ).
fof(c_0_5,negated_conjecture,
~ ? [X39,X23,X22,X16] :
( ? [X17] :
( r4(X22,X22,X17)
& X16 = X17 )
& ? [X25] :
( r4(X23,X23,X25)
& ? [X19] :
( r4(X39,X39,X19)
& r3(X19,X25,X16) ) ) ),
inference(assume_negation,[status(cth)],[fermattothepoweroftwo]) ).
fof(c_0_6,plain,
! [X4] :
( ( r1(X4)
| ~ r1(X4) )
& ( X4 = esk20_0
| ~ r1(X4) )
& ( r1(X4)
| X4 != esk20_0 )
& ( X4 = esk20_0
| X4 != esk20_0 ) ),
inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_simplification,[status(thm)],[axiom_1])])])]) ).
cnf(c_0_7,plain,
r1(esk15_1(X1)),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_8,plain,
esk13_1(X1) = esk15_1(X1),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
fof(c_0_9,negated_conjecture,
! [X40,X41,X42,X43,X44,X45,X46] :
( ~ r4(X42,X42,X44)
| X43 != X44
| ~ r4(X41,X41,X45)
| ~ r4(X40,X40,X46)
| ~ r3(X46,X45,X43) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])])])]) ).
cnf(c_0_10,plain,
( X1 = esk20_0
| ~ r1(X1) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_11,plain,
r1(esk13_1(X1)),
inference(rw,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_12,plain,
r1(esk14_1(X1)),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
fof(c_0_13,plain,
! [X33] :
( r1(esk11_1(X33))
& r3(X33,esk11_1(X33),esk10_1(X33))
& esk10_1(X33) = X33 ),
inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[axiom_4a])])])]) ).
cnf(c_0_14,negated_conjecture,
( ~ r3(X1,X2,X3)
| ~ r4(X4,X4,X1)
| ~ r4(X5,X5,X2)
| X3 != X6
| ~ r4(X7,X7,X6) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_15,plain,
r4(X1,esk14_1(X1),esk13_1(X1)),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_16,plain,
esk13_1(X1) = esk20_0,
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_17,plain,
esk14_1(X1) = esk20_0,
inference(spm,[status(thm)],[c_0_10,c_0_12]) ).
cnf(c_0_18,plain,
r3(X1,esk11_1(X1),esk10_1(X1)),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_19,plain,
esk10_1(X1) = X1,
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_20,plain,
r1(esk11_1(X1)),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_21,negated_conjecture,
( ~ r4(X1,X1,X2)
| ~ r4(X3,X3,X4)
| ~ r4(X5,X5,X6)
| ~ r3(X6,X4,X2) ),
inference(er,[status(thm)],[c_0_14]) ).
cnf(c_0_22,plain,
r4(X1,esk20_0,esk20_0),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_15,c_0_16]),c_0_17]) ).
cnf(c_0_23,plain,
r3(X1,esk11_1(X1),X1),
inference(rw,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_24,plain,
esk11_1(X1) = esk20_0,
inference(spm,[status(thm)],[c_0_10,c_0_20]) ).
cnf(c_0_25,negated_conjecture,
( ~ r4(X1,X1,X2)
| ~ r4(X3,X3,X4)
| ~ r3(X4,X2,esk20_0) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_26,plain,
r3(X1,esk20_0,X1),
inference(rw,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_27,negated_conjecture,
( ~ r4(X1,X1,esk20_0)
| ~ r4(X2,X2,esk20_0) ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_28,negated_conjecture,
~ r4(X1,X1,esk20_0),
inference(spm,[status(thm)],[c_0_27,c_0_22]) ).
cnf(c_0_29,negated_conjecture,
$false,
inference(spm,[status(thm)],[c_0_28,c_0_22]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : NUN059+2 : TPTP v8.1.0. Bugfixed v7.4.0.
% 0.10/0.12 % Command : run_ET %s %d
% 0.12/0.33 % Computer : n020.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Thu Jun 2 07:54:38 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.21/1.40 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.21/1.40 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.21/1.40 # Preprocessing time : 0.016 s
% 0.21/1.40
% 0.21/1.40 # Proof found!
% 0.21/1.40 # SZS status Theorem
% 0.21/1.40 # SZS output start CNFRefutation
% See solution above
% 0.21/1.40 # Proof object total steps : 30
% 0.21/1.40 # Proof object clause steps : 21
% 0.21/1.40 # Proof object formula steps : 9
% 0.21/1.40 # Proof object conjectures : 9
% 0.21/1.40 # Proof object clause conjectures : 6
% 0.21/1.40 # Proof object formula conjectures : 3
% 0.21/1.40 # Proof object initial clauses used : 9
% 0.21/1.40 # Proof object initial formulas used : 4
% 0.21/1.40 # Proof object generating inferences : 7
% 0.21/1.40 # Proof object simplifying inferences : 6
% 0.21/1.40 # Training examples: 0 positive, 0 negative
% 0.21/1.40 # Parsed axioms : 12
% 0.21/1.40 # Removed by relevancy pruning/SinE : 0
% 0.21/1.40 # Initial clauses : 40
% 0.21/1.40 # Removed in clause preprocessing : 12
% 0.21/1.40 # Initial clauses in saturation : 28
% 0.21/1.40 # Processed clauses : 54
% 0.21/1.40 # ...of these trivial : 0
% 0.21/1.40 # ...subsumed : 0
% 0.21/1.40 # ...remaining for further processing : 54
% 0.21/1.40 # Other redundant clauses eliminated : 4
% 0.21/1.40 # Clauses deleted for lack of memory : 0
% 0.21/1.40 # Backward-subsumed : 0
% 0.21/1.40 # Backward-rewritten : 17
% 0.21/1.40 # Generated clauses : 59
% 0.21/1.40 # ...of the previous two non-trivial : 62
% 0.21/1.40 # Contextual simplify-reflections : 0
% 0.21/1.40 # Paramodulations : 52
% 0.21/1.40 # Factorizations : 0
% 0.21/1.40 # Equation resolutions : 7
% 0.21/1.40 # Current number of processed clauses : 34
% 0.21/1.40 # Positive orientable unit clauses : 15
% 0.21/1.40 # Positive unorientable unit clauses: 0
% 0.21/1.40 # Negative unit clauses : 4
% 0.21/1.40 # Non-unit-clauses : 15
% 0.21/1.40 # Current number of unprocessed clauses: 27
% 0.21/1.40 # ...number of literals in the above : 56
% 0.21/1.40 # Current number of archived formulas : 0
% 0.21/1.40 # Current number of archived clauses : 21
% 0.21/1.40 # Clause-clause subsumption calls (NU) : 83
% 0.21/1.40 # Rec. Clause-clause subsumption calls : 42
% 0.21/1.40 # Non-unit clause-clause subsumptions : 0
% 0.21/1.40 # Unit Clause-clause subsumption calls : 61
% 0.21/1.40 # Rewrite failures with RHS unbound : 0
% 0.21/1.40 # BW rewrite match attempts : 33
% 0.21/1.40 # BW rewrite match successes : 13
% 0.21/1.40 # Condensation attempts : 0
% 0.21/1.40 # Condensation successes : 0
% 0.21/1.40 # Termbank termtop insertions : 1880
% 0.21/1.40
% 0.21/1.40 # -------------------------------------------------
% 0.21/1.40 # User time : 0.015 s
% 0.21/1.40 # System time : 0.004 s
% 0.21/1.40 # Total time : 0.019 s
% 0.21/1.40 # Maximum resident set size: 2996 pages
%------------------------------------------------------------------------------