TSTP Solution File: NUN059+2 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : NUN059+2 : TPTP v8.1.2. Bugfixed v7.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n027.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 : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 19:09:07 EDT 2023
% Result : Theorem 0.21s 0.52s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 4
% Syntax : Number of formulae : 31 ( 16 unt; 0 def)
% Number of atoms : 77 ( 22 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 76 ( 30 ~; 21 |; 25 &)
% ( 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 : 70 ( 7 sgn; 14 !; 21 ?)
% Comments :
%------------------------------------------------------------------------------
fof(axiom_1,axiom,
? [X1] :
! [X2] :
( ( ~ r1(X2)
& X2 != X1 )
| ( r1(X2)
& X2 = X1 ) ),
file('/export/starexec/sandbox/tmp/tmp.NfDBtd3r3Z/E---3.1_20966.p',axiom_1) ).
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/sandbox/tmp/tmp.NfDBtd3r3Z/E---3.1_20966.p',fermattothepoweroftwo) ).
fof(axiom_4a,axiom,
! [X30] :
? [X31] :
( ? [X32] :
( r1(X32)
& r3(X30,X32,X31) )
& X31 = X30 ),
file('/export/starexec/sandbox/tmp/tmp.NfDBtd3r3Z/E---3.1_20966.p',axiom_4a) ).
fof(axiom_5a,axiom,
! [X33] :
? [X34] :
( ? [X35] :
( r1(X35)
& r4(X33,X35,X34) )
& ? [X36] :
( r1(X36)
& X34 = X36 ) ),
file('/export/starexec/sandbox/tmp/tmp.NfDBtd3r3Z/E---3.1_20966.p',axiom_5a) ).
fof(c_0_4,plain,
? [X1] :
! [X2] :
( ( ~ r1(X2)
& X2 != X1 )
| ( r1(X2)
& X2 = X1 ) ),
inference(fof_simplification,[status(thm)],[axiom_1]) ).
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,
! [X67] :
( r1(esk11_1(X67))
& r3(X67,esk11_1(X67),esk10_1(X67))
& esk10_1(X67) = X67 ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[axiom_4a])]) ).
fof(c_0_7,plain,
! [X93] :
( ( r1(X93)
| ~ r1(X93) )
& ( X93 = esk20_0
| ~ r1(X93) )
& ( r1(X93)
| X93 != esk20_0 )
& ( X93 = esk20_0
| X93 != esk20_0 ) ),
inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[c_0_4])])]) ).
fof(c_0_8,negated_conjecture,
! [X44,X45,X46,X47,X48,X49,X50] :
( ~ r4(X46,X46,X48)
| X47 != X48
| ~ r4(X45,X45,X49)
| ~ r4(X44,X44,X50)
| ~ r3(X50,X49,X47) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])]) ).
cnf(c_0_9,plain,
r3(X1,esk11_1(X1),esk10_1(X1)),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,plain,
esk10_1(X1) = X1,
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_11,plain,
( X1 = esk20_0
| ~ r1(X1) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_12,plain,
r1(esk11_1(X1)),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
fof(c_0_13,plain,
! [X74] :
( r1(esk14_1(X74))
& r4(X74,esk14_1(X74),esk13_1(X74))
& r1(esk15_1(X74))
& esk13_1(X74) = esk15_1(X74) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[axiom_5a])]) ).
cnf(c_0_14,negated_conjecture,
( ~ r4(X1,X1,X2)
| X3 != X2
| ~ r4(X4,X4,X5)
| ~ r4(X6,X6,X7)
| ~ r3(X7,X5,X3) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_15,plain,
r3(X1,esk11_1(X1),X1),
inference(rw,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_16,plain,
esk11_1(X1) = esk20_0,
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_17,plain,
r4(X1,esk14_1(X1),esk13_1(X1)),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_18,plain,
esk13_1(X1) = esk15_1(X1),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_19,plain,
r1(esk14_1(X1)),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_20,plain,
r1(esk15_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(X2,X4,X6) ),
inference(er,[status(thm)],[c_0_14]) ).
cnf(c_0_22,plain,
r3(X1,esk20_0,X1),
inference(rw,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_23,plain,
r4(X1,esk14_1(X1),esk15_1(X1)),
inference(rw,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_24,plain,
esk14_1(X1) = esk20_0,
inference(spm,[status(thm)],[c_0_11,c_0_19]) ).
cnf(c_0_25,plain,
esk15_1(X1) = esk20_0,
inference(spm,[status(thm)],[c_0_11,c_0_20]) ).
cnf(c_0_26,negated_conjecture,
( ~ r4(X1,X1,esk20_0)
| ~ r4(X2,X2,X3)
| ~ r4(X4,X4,X3) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_27,plain,
r4(X1,esk20_0,esk20_0),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_23,c_0_24]),c_0_25]) ).
cnf(c_0_28,negated_conjecture,
( ~ r4(X1,X1,esk20_0)
| ~ r4(X2,X2,esk20_0) ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_29,negated_conjecture,
~ r4(X1,X1,esk20_0),
inference(spm,[status(thm)],[c_0_28,c_0_27]) ).
cnf(c_0_30,negated_conjecture,
$false,
inference(spm,[status(thm)],[c_0_29,c_0_27]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : NUN059+2 : TPTP v8.1.2. Bugfixed v7.4.0.
% 0.08/0.15 % Command : run_E %s %d THM
% 0.14/0.36 % Computer : n027.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 2400
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Mon Oct 2 21:12:45 EDT 2023
% 0.14/0.36 % CPUTime :
% 0.21/0.51 Running first-order theorem proving
% 0.21/0.51 Running: /export/starexec/sandbox/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/sandbox/tmp/tmp.NfDBtd3r3Z/E---3.1_20966.p
% 0.21/0.52 # Version: 3.1pre001
% 0.21/0.52 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.52 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.52 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.52 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.52 # Starting sh5l with 300s (1) cores
% 0.21/0.52 # new_bool_3 with pid 21045 completed with status 0
% 0.21/0.52 # Result found by new_bool_3
% 0.21/0.52 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.52 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.52 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.52 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/0.52 # Search class: FGHSM-FFMF21-SFFFFFNN
% 0.21/0.52 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.52 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S4b with 181s (1) cores
% 0.21/0.52 # G-E--_208_C18_F1_SE_CS_SP_PS_S4b with pid 21049 completed with status 0
% 0.21/0.52 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S4b
% 0.21/0.52 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.52 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.52 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.52 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/0.52 # Search class: FGHSM-FFMF21-SFFFFFNN
% 0.21/0.52 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.52 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S4b with 181s (1) cores
% 0.21/0.52 # Preprocessing time : 0.001 s
% 0.21/0.52 # Presaturation interreduction done
% 0.21/0.52
% 0.21/0.52 # Proof found!
% 0.21/0.52 # SZS status Theorem
% 0.21/0.52 # SZS output start CNFRefutation
% See solution above
% 0.21/0.52 # Parsed axioms : 12
% 0.21/0.52 # Removed by relevancy pruning/SinE : 0
% 0.21/0.52 # Initial clauses : 40
% 0.21/0.52 # Removed in clause preprocessing : 8
% 0.21/0.52 # Initial clauses in saturation : 32
% 0.21/0.52 # Processed clauses : 79
% 0.21/0.52 # ...of these trivial : 0
% 0.21/0.52 # ...subsumed : 0
% 0.21/0.52 # ...remaining for further processing : 79
% 0.21/0.52 # Other redundant clauses eliminated : 7
% 0.21/0.52 # Clauses deleted for lack of memory : 0
% 0.21/0.52 # Backward-subsumed : 2
% 0.21/0.52 # Backward-rewritten : 6
% 0.21/0.52 # Generated clauses : 37
% 0.21/0.52 # ...of the previous two non-redundant : 37
% 0.21/0.52 # ...aggressively subsumed : 0
% 0.21/0.52 # Contextual simplify-reflections : 0
% 0.21/0.52 # Paramodulations : 30
% 0.21/0.52 # Factorizations : 0
% 0.21/0.52 # NegExts : 0
% 0.21/0.52 # Equation resolutions : 7
% 0.21/0.52 # Total rewrite steps : 18
% 0.21/0.52 # Propositional unsat checks : 0
% 0.21/0.52 # Propositional check models : 0
% 0.21/0.52 # Propositional check unsatisfiable : 0
% 0.21/0.52 # Propositional clauses : 0
% 0.21/0.52 # Propositional clauses after purity: 0
% 0.21/0.52 # Propositional unsat core size : 0
% 0.21/0.52 # Propositional preprocessing time : 0.000
% 0.21/0.52 # Propositional encoding time : 0.000
% 0.21/0.52 # Propositional solver time : 0.000
% 0.21/0.52 # Success case prop preproc time : 0.000
% 0.21/0.52 # Success case prop encoding time : 0.000
% 0.21/0.52 # Success case prop solver time : 0.000
% 0.21/0.52 # Current number of processed clauses : 32
% 0.21/0.52 # Positive orientable unit clauses : 17
% 0.21/0.52 # Positive unorientable unit clauses: 0
% 0.21/0.52 # Negative unit clauses : 2
% 0.21/0.52 # Non-unit-clauses : 13
% 0.21/0.52 # Current number of unprocessed clauses: 17
% 0.21/0.52 # ...number of literals in the above : 30
% 0.21/0.52 # Current number of archived formulas : 0
% 0.21/0.52 # Current number of archived clauses : 40
% 0.21/0.52 # Clause-clause subsumption calls (NU) : 42
% 0.21/0.52 # Rec. Clause-clause subsumption calls : 23
% 0.21/0.52 # Non-unit clause-clause subsumptions : 0
% 0.21/0.52 # Unit Clause-clause subsumption calls : 17
% 0.21/0.52 # Rewrite failures with RHS unbound : 0
% 0.21/0.52 # BW rewrite match attempts : 14
% 0.21/0.52 # BW rewrite match successes : 5
% 0.21/0.52 # Condensation attempts : 0
% 0.21/0.52 # Condensation successes : 0
% 0.21/0.52 # Termbank termtop insertions : 1727
% 0.21/0.52
% 0.21/0.52 # -------------------------------------------------
% 0.21/0.52 # User time : 0.006 s
% 0.21/0.52 # System time : 0.003 s
% 0.21/0.52 # Total time : 0.009 s
% 0.21/0.52 # Maximum resident set size: 1884 pages
% 0.21/0.52
% 0.21/0.52 # -------------------------------------------------
% 0.21/0.52 # User time : 0.006 s
% 0.21/0.52 # System time : 0.006 s
% 0.21/0.52 # Total time : 0.012 s
% 0.21/0.52 # Maximum resident set size: 1716 pages
% 0.21/0.52 % E---3.1 exiting
% 0.21/0.53 % E---3.1 exiting
%------------------------------------------------------------------------------