TSTP Solution File: NUN068+2 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : NUN068+2 : TPTP v8.1.2. Released v7.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n007.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 : 300s
% DateTime : Sat May 4 09:08:35 EDT 2024
% Result : Theorem 0.21s 0.51s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 5
% Syntax : Number of formulae : 41 ( 5 unt; 0 def)
% Number of atoms : 126 ( 53 equ)
% Maximal formula atoms : 12 ( 3 avg)
% Number of connectives : 145 ( 60 ~; 64 |; 21 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 1 con; 0-1 aty)
% Number of variables : 77 ( 4 sgn 37 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(nonzerosnononesexist,conjecture,
? [X39] :
( ! [X22] :
( ! [X23] :
( ~ r1(X23)
| ~ r2(X23,X22) )
| X39 != X22 )
& ! [X16] :
( ~ r1(X16)
| X39 != X16 ) ),
file('/export/starexec/sandbox/tmp/tmp.y0sEInStHk/E---3.1_414.p',nonzerosnononesexist) ).
fof(axiom_1,axiom,
? [X1] :
! [X2] :
( ( ~ r1(X2)
& X2 != X1 )
| ( r1(X2)
& X2 = X1 ) ),
file('/export/starexec/sandbox/tmp/tmp.y0sEInStHk/E---3.1_414.p',axiom_1) ).
fof(axiom_3a,axiom,
! [X26,X27] :
( ! [X28] :
( ! [X29] :
( ~ r2(X26,X29)
| X29 != X28 )
| ~ r2(X27,X28) )
| X26 = X27 ),
file('/export/starexec/sandbox/tmp/tmp.y0sEInStHk/E---3.1_414.p',axiom_3a) ).
fof(axiom_2,axiom,
! [X3] :
? [X4] :
! [X5] :
( ( ~ r2(X3,X5)
& X5 != X4 )
| ( r2(X3,X5)
& X5 = X4 ) ),
file('/export/starexec/sandbox/tmp/tmp.y0sEInStHk/E---3.1_414.p',axiom_2) ).
fof(axiom_7a,axiom,
! [X41,X42] :
( ! [X43] :
( ~ r1(X43)
| X43 != X42 )
| ~ r2(X41,X42) ),
file('/export/starexec/sandbox/tmp/tmp.y0sEInStHk/E---3.1_414.p',axiom_7a) ).
fof(c_0_5,negated_conjecture,
~ ? [X39] :
( ! [X22] :
( ! [X23] :
( ~ r1(X23)
| ~ r2(X23,X22) )
| X39 != X22 )
& ! [X16] :
( ~ r1(X16)
| X39 != X16 ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[nonzerosnononesexist])]) ).
fof(c_0_6,plain,
? [X1] :
! [X2] :
( ( ~ r1(X2)
& X2 != X1 )
| ( r1(X2)
& X2 = X1 ) ),
inference(fof_simplification,[status(thm)],[axiom_1]) ).
fof(c_0_7,plain,
! [X26,X27] :
( ! [X28] :
( ! [X29] :
( ~ r2(X26,X29)
| X29 != X28 )
| ~ r2(X27,X28) )
| X26 = X27 ),
inference(fof_simplification,[status(thm)],[axiom_3a]) ).
fof(c_0_8,plain,
! [X3] :
? [X4] :
! [X5] :
( ( ~ r2(X3,X5)
& X5 != X4 )
| ( r2(X3,X5)
& X5 = X4 ) ),
inference(fof_simplification,[status(thm)],[axiom_2]) ).
fof(c_0_9,negated_conjecture,
! [X87] :
( ( r1(esk23_1(X87))
| r1(esk22_1(X87)) )
& ( X87 = esk23_1(X87)
| r1(esk22_1(X87)) )
& ( r1(esk23_1(X87))
| r2(esk22_1(X87),esk21_1(X87)) )
& ( X87 = esk23_1(X87)
| r2(esk22_1(X87),esk21_1(X87)) )
& ( r1(esk23_1(X87))
| X87 = esk21_1(X87) )
& ( X87 = esk23_1(X87)
| X87 = esk21_1(X87) ) ),
inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])])]) ).
fof(c_0_10,plain,
! [X45] :
( ( r1(X45)
| ~ r1(X45) )
& ( X45 = esk1_0
| ~ r1(X45) )
& ( r1(X45)
| X45 != esk1_0 )
& ( X45 = esk1_0
| X45 != esk1_0 ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[c_0_6])])])]) ).
fof(c_0_11,plain,
! [X41,X42] :
( ! [X43] :
( ~ r1(X43)
| X43 != X42 )
| ~ r2(X41,X42) ),
inference(fof_simplification,[status(thm)],[axiom_7a]) ).
fof(c_0_12,plain,
! [X69,X70,X71,X72] :
( ~ r2(X69,X72)
| X72 != X71
| ~ r2(X70,X71)
| X69 = X70 ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_7])])]) ).
fof(c_0_13,plain,
! [X46,X48] :
( ( r2(X46,X48)
| ~ r2(X46,X48) )
& ( X48 = esk2_1(X46)
| ~ r2(X46,X48) )
& ( r2(X46,X48)
| X48 != esk2_1(X46) )
& ( X48 = esk2_1(X46)
| X48 != esk2_1(X46) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[c_0_8])])])]) ).
cnf(c_0_14,negated_conjecture,
( r1(esk23_1(X1))
| r2(esk22_1(X1),esk21_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_15,negated_conjecture,
( r1(esk23_1(X1))
| X1 = esk21_1(X1) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_16,plain,
( X1 = esk1_0
| ~ r1(X1) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_17,negated_conjecture,
( r1(esk23_1(X1))
| r1(esk22_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_18,negated_conjecture,
( X1 = esk23_1(X1)
| r2(esk22_1(X1),esk21_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_19,negated_conjecture,
( X1 = esk23_1(X1)
| X1 = esk21_1(X1) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_20,negated_conjecture,
( X1 = esk23_1(X1)
| r1(esk22_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
fof(c_0_21,plain,
! [X84,X85,X86] :
( ~ r1(X86)
| X86 != X85
| ~ r2(X84,X85) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_11])])]) ).
cnf(c_0_22,plain,
( X1 = X4
| ~ r2(X1,X2)
| X2 != X3
| ~ r2(X4,X3) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_23,plain,
( r2(X1,X2)
| X2 != esk2_1(X1) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_24,negated_conjecture,
( r2(esk22_1(X1),X1)
| r1(esk23_1(X1)) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_25,negated_conjecture,
( esk22_1(X1) = esk1_0
| r1(esk23_1(X1)) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_26,negated_conjecture,
( esk23_1(X1) = X1
| r2(esk22_1(X1),X1) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_27,negated_conjecture,
( esk22_1(X1) = esk1_0
| esk23_1(X1) = X1 ),
inference(spm,[status(thm)],[c_0_16,c_0_20]) ).
cnf(c_0_28,plain,
( ~ r1(X1)
| X1 != X2
| ~ r2(X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_29,plain,
( X1 = X2
| ~ r2(X2,X3)
| ~ r2(X1,X3) ),
inference(er,[status(thm)],[c_0_22]) ).
cnf(c_0_30,plain,
r2(X1,esk2_1(X1)),
inference(er,[status(thm)],[c_0_23]) ).
cnf(c_0_31,negated_conjecture,
( r2(esk1_0,X1)
| r1(esk23_1(X1)) ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_32,negated_conjecture,
( esk23_1(X1) = X1
| r2(esk1_0,X1) ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_33,plain,
( ~ r2(X1,X2)
| ~ r1(X2) ),
inference(er,[status(thm)],[c_0_28]) ).
cnf(c_0_34,plain,
( X1 = X2
| ~ r2(X1,esk2_1(X2)) ),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_35,negated_conjecture,
( r2(esk1_0,X1)
| r1(X1) ),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_36,plain,
~ r1(esk2_1(X1)),
inference(spm,[status(thm)],[c_0_33,c_0_30]) ).
cnf(c_0_37,plain,
( r1(X1)
| X1 != esk1_0 ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_38,negated_conjecture,
esk1_0 = X1,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_36]) ).
cnf(c_0_39,plain,
r1(esk1_0),
inference(er,[status(thm)],[c_0_37]) ).
cnf(c_0_40,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_36,c_0_38]),c_0_39])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : NUN068+2 : TPTP v8.1.2. Released v7.3.0.
% 0.03/0.14 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n007.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Fri May 3 11:54:35 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.21/0.49 Running first-order theorem proving
% 0.21/0.49 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.y0sEInStHk/E---3.1_414.p
% 0.21/0.51 # Version: 3.1.0
% 0.21/0.51 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.51 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.51 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.51 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.51 # Starting sh5l with 300s (1) cores
% 0.21/0.51 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 556 completed with status 0
% 0.21/0.51 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.21/0.51 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.51 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.51 # No SInE strategy applied
% 0.21/0.51 # Search class: FGHSM-FFMF21-SFFFFFNN
% 0.21/0.51 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.21/0.51 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S4b with 811s (1) cores
% 0.21/0.51 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.21/0.51 # Starting new_bool_3 with 136s (1) cores
% 0.21/0.51 # Starting new_bool_1 with 136s (1) cores
% 0.21/0.51 # Starting G-E--_300_C18_F1_SE_CS_SP_PS_S0Y with 136s (1) cores
% 0.21/0.51 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 564 completed with status 0
% 0.21/0.51 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.21/0.51 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.51 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.51 # No SInE strategy applied
% 0.21/0.51 # Search class: FGHSM-FFMF21-SFFFFFNN
% 0.21/0.51 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.21/0.51 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S4b with 811s (1) cores
% 0.21/0.51 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.21/0.51 # Preprocessing time : 0.002 s
% 0.21/0.51 # Presaturation interreduction done
% 0.21/0.51
% 0.21/0.51 # Proof found!
% 0.21/0.51 # SZS status Theorem
% 0.21/0.51 # SZS output start CNFRefutation
% See solution above
% 0.21/0.51 # Parsed axioms : 12
% 0.21/0.51 # Removed by relevancy pruning/SinE : 0
% 0.21/0.51 # Initial clauses : 45
% 0.21/0.51 # Removed in clause preprocessing : 12
% 0.21/0.51 # Initial clauses in saturation : 33
% 0.21/0.51 # Processed clauses : 117
% 0.21/0.51 # ...of these trivial : 0
% 0.21/0.51 # ...subsumed : 10
% 0.21/0.51 # ...remaining for further processing : 107
% 0.21/0.51 # Other redundant clauses eliminated : 6
% 0.21/0.51 # Clauses deleted for lack of memory : 0
% 0.21/0.51 # Backward-subsumed : 1
% 0.21/0.51 # Backward-rewritten : 60
% 0.21/0.51 # Generated clauses : 113
% 0.21/0.51 # ...of the previous two non-redundant : 94
% 0.21/0.51 # ...aggressively subsumed : 0
% 0.21/0.51 # Contextual simplify-reflections : 0
% 0.21/0.51 # Paramodulations : 107
% 0.21/0.51 # Factorizations : 0
% 0.21/0.51 # NegExts : 0
% 0.21/0.51 # Equation resolutions : 6
% 0.21/0.51 # Disequality decompositions : 0
% 0.21/0.51 # Total rewrite steps : 35
% 0.21/0.51 # ...of those cached : 0
% 0.21/0.51 # Propositional unsat checks : 0
% 0.21/0.51 # Propositional check models : 0
% 0.21/0.51 # Propositional check unsatisfiable : 0
% 0.21/0.51 # Propositional clauses : 0
% 0.21/0.51 # Propositional clauses after purity: 0
% 0.21/0.51 # Propositional unsat core size : 0
% 0.21/0.51 # Propositional preprocessing time : 0.000
% 0.21/0.51 # Propositional encoding time : 0.000
% 0.21/0.51 # Propositional solver time : 0.000
% 0.21/0.51 # Success case prop preproc time : 0.000
% 0.21/0.51 # Success case prop encoding time : 0.000
% 0.21/0.51 # Success case prop solver time : 0.000
% 0.21/0.51 # Current number of processed clauses : 7
% 0.21/0.51 # Positive orientable unit clauses : 3
% 0.21/0.51 # Positive unorientable unit clauses: 1
% 0.21/0.51 # Negative unit clauses : 0
% 0.21/0.51 # Non-unit-clauses : 3
% 0.21/0.51 # Current number of unprocessed clauses: 42
% 0.21/0.51 # ...number of literals in the above : 97
% 0.21/0.51 # Current number of archived formulas : 0
% 0.21/0.51 # Current number of archived clauses : 98
% 0.21/0.51 # Clause-clause subsumption calls (NU) : 145
% 0.21/0.51 # Rec. Clause-clause subsumption calls : 132
% 0.21/0.51 # Non-unit clause-clause subsumptions : 8
% 0.21/0.51 # Unit Clause-clause subsumption calls : 61
% 0.21/0.51 # Rewrite failures with RHS unbound : 0
% 0.21/0.51 # BW rewrite match attempts : 77
% 0.21/0.51 # BW rewrite match successes : 35
% 0.21/0.51 # Condensation attempts : 0
% 0.21/0.51 # Condensation successes : 0
% 0.21/0.51 # Termbank termtop insertions : 2622
% 0.21/0.51 # Search garbage collected termcells : 317
% 0.21/0.51
% 0.21/0.51 # -------------------------------------------------
% 0.21/0.51 # User time : 0.012 s
% 0.21/0.51 # System time : 0.003 s
% 0.21/0.51 # Total time : 0.015 s
% 0.21/0.51 # Maximum resident set size: 1796 pages
% 0.21/0.51
% 0.21/0.51 # -------------------------------------------------
% 0.21/0.51 # User time : 0.039 s
% 0.21/0.51 # System time : 0.011 s
% 0.21/0.51 # Total time : 0.049 s
% 0.21/0.51 # Maximum resident set size: 1728 pages
% 0.21/0.51 % E---3.1 exiting
% 0.21/0.51 % E exiting
%------------------------------------------------------------------------------