TSTP Solution File: NUN065+2 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : NUN065+2 : TPTP v8.1.0. Released v7.3.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% 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 : Mon Jul 18 16:24:54 EDT 2022
% Result : Theorem 7.74s 2.42s
% Output : CNFRefutation 7.74s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 5
% Syntax : Number of formulae : 44 ( 6 unt; 0 def)
% Number of atoms : 128 ( 64 equ)
% Maximal formula atoms : 12 ( 2 avg)
% Number of connectives : 137 ( 53 ~; 67 |; 17 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 3 ( 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 : 75 ( 4 sgn 27 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(nononesexist,conjecture,
? [X39] :
( ! [X22] :
( ! [X23] :
( ~ r1(X23)
| ~ r2(X23,X22) )
| X39 != X22 )
& ! [X16] :
( ~ r1(X16)
| X39 != X16 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',nononesexist) ).
fof(axiom_1,axiom,
? [X1] :
! [X2] :
( ( ~ r1(X2)
& X2 != X1 )
| ( r1(X2)
& X2 = X1 ) ),
file('/export/starexec/sandbox/benchmark/Axioms/NUM008+0.ax',axiom_1) ).
fof(axiom_7a,axiom,
! [X41,X42] :
( ! [X43] :
( ~ r1(X43)
| X43 != X42 )
| ~ r2(X41,X42) ),
file('/export/starexec/sandbox/benchmark/Axioms/NUM008+0.ax',axiom_7a) ).
fof(axiom_2,axiom,
! [X3] :
? [X4] :
! [X5] :
( ( ~ r2(X3,X5)
& X5 != X4 )
| ( r2(X3,X5)
& X5 = X4 ) ),
file('/export/starexec/sandbox/benchmark/Axioms/NUM008+0.ax',axiom_2) ).
fof(axiom_3a,axiom,
! [X26,X27] :
( ! [X28] :
( ! [X29] :
( ~ r2(X26,X29)
| X29 != X28 )
| ~ r2(X27,X28) )
| X26 = X27 ),
file('/export/starexec/sandbox/benchmark/Axioms/NUM008+0.ax',axiom_3a) ).
fof(c_0_5,negated_conjecture,
~ ? [X39] :
( ! [X22] :
( ! [X23] :
( ~ r1(X23)
| ~ r2(X23,X22) )
| X39 != X22 )
& ! [X16] :
( ~ r1(X16)
| X39 != X16 ) ),
inference(assume_negation,[status(cth)],[nononesexist]) ).
fof(c_0_6,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(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_simplification,[status(thm)],[axiom_1])])])]) ).
fof(c_0_7,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)],[inference(fof_simplification,[status(thm)],[c_0_5])])])])]) ).
cnf(c_0_8,plain,
( X1 = esk1_0
| ~ r1(X1) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_9,negated_conjecture,
( r1(esk23_1(X1))
| r1(esk22_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
fof(c_0_10,plain,
! [X84,X85,X86] :
( ~ r1(X86)
| X86 != X85
| ~ r2(X84,X85) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_simplification,[status(thm)],[axiom_7a])])]) ).
fof(c_0_11,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(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_simplification,[status(thm)],[axiom_2])])])]) ).
fof(c_0_12,plain,
! [X69,X70,X71,X72] :
( ~ r2(X69,X72)
| X72 != X71
| ~ r2(X70,X71)
| X69 = X70 ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_simplification,[status(thm)],[axiom_3a])])]) ).
cnf(c_0_13,negated_conjecture,
( r1(esk23_1(X1))
| r2(esk22_1(X1),esk21_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_14,negated_conjecture,
( esk22_1(X1) = esk1_0
| r1(esk23_1(X1)) ),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_15,plain,
( ~ r1(X1)
| X1 != X2
| ~ r2(X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_16,plain,
( r2(X1,X2)
| X2 != esk2_1(X1) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_17,negated_conjecture,
( X1 = esk23_1(X1)
| r1(esk22_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_18,plain,
( X1 = X4
| ~ r2(X1,X2)
| X2 != X3
| ~ r2(X4,X3) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_19,negated_conjecture,
( esk23_1(X1) = esk1_0
| r2(esk22_1(X1),esk21_1(X1)) ),
inference(spm,[status(thm)],[c_0_8,c_0_13]) ).
cnf(c_0_20,negated_conjecture,
( esk22_1(X1) = esk1_0
| esk23_1(X1) = esk1_0 ),
inference(spm,[status(thm)],[c_0_8,c_0_14]) ).
cnf(c_0_21,plain,
( ~ r2(X1,X2)
| ~ r1(X2) ),
inference(er,[status(thm)],[c_0_15]) ).
cnf(c_0_22,plain,
r2(X1,esk2_1(X1)),
inference(er,[status(thm)],[c_0_16]) ).
cnf(c_0_23,negated_conjecture,
( r1(esk23_1(X1))
| X1 = esk21_1(X1) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_24,negated_conjecture,
( X1 = esk23_1(X1)
| X1 = esk21_1(X1) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_25,negated_conjecture,
( X1 = esk23_1(X1)
| r2(esk22_1(X1),esk21_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_26,negated_conjecture,
( esk22_1(X1) = esk1_0
| esk23_1(X1) = X1 ),
inference(spm,[status(thm)],[c_0_8,c_0_17]) ).
cnf(c_0_27,plain,
( X1 = X2
| ~ r2(X2,X3)
| ~ r2(X1,X3) ),
inference(er,[status(thm)],[c_0_18]) ).
cnf(c_0_28,negated_conjecture,
( esk23_1(X1) = esk1_0
| r2(esk1_0,esk21_1(X1)) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_29,plain,
~ r1(esk2_1(X1)),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_30,negated_conjecture,
( esk21_1(X1) = X1
| r1(X1) ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_31,negated_conjecture,
( esk23_1(X1) = X1
| r2(esk1_0,esk21_1(X1)) ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_32,negated_conjecture,
( esk23_1(X1) = esk1_0
| X2 = esk1_0
| ~ r2(X2,esk21_1(X1)) ),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_33,negated_conjecture,
esk21_1(esk2_1(X1)) = esk2_1(X1),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_34,negated_conjecture,
( esk23_1(X1) = X1
| X2 = esk1_0
| ~ r2(X2,esk21_1(X1)) ),
inference(spm,[status(thm)],[c_0_27,c_0_31]) ).
cnf(c_0_35,negated_conjecture,
( esk23_1(esk2_1(X1)) = esk1_0
| X2 = esk1_0
| ~ r2(X2,esk2_1(X1)) ),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_36,negated_conjecture,
( esk23_1(esk2_1(X1)) = esk2_1(X1)
| X2 = esk1_0
| ~ r2(X2,esk2_1(X1)) ),
inference(spm,[status(thm)],[c_0_34,c_0_33]) ).
cnf(c_0_37,negated_conjecture,
( esk23_1(esk2_1(X1)) = esk1_0
| X1 = esk1_0 ),
inference(spm,[status(thm)],[c_0_35,c_0_22]) ).
cnf(c_0_38,negated_conjecture,
( esk23_1(esk2_1(X1)) = esk2_1(X1)
| X1 = esk1_0 ),
inference(spm,[status(thm)],[c_0_36,c_0_22]) ).
cnf(c_0_39,plain,
( r1(X1)
| X1 != esk1_0 ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_40,negated_conjecture,
( esk2_1(X1) = esk1_0
| X1 = esk1_0 ),
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_41,plain,
r1(esk1_0),
inference(er,[status(thm)],[c_0_39]) ).
cnf(c_0_42,negated_conjecture,
X1 = esk1_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_40]),c_0_41])]) ).
cnf(c_0_43,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_29,c_0_42]),c_0_41])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : NUN065+2 : TPTP v8.1.0. Released v7.3.0.
% 0.07/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.34 % Computer : n018.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Thu Jun 2 09:15:46 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.19/0.45 # ENIGMATIC: Selected SinE mode:
% 0.19/0.46 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.46 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.19/0.46 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.19/0.46 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 7.74/2.42 # ENIGMATIC: Solved by autoschedule:
% 7.74/2.42 # No SInE strategy applied
% 7.74/2.42 # Trying AutoSched0 for 150 seconds
% 7.74/2.42 # AutoSched0-Mode selected heuristic G_E___208_B00_00_F1_SE_CS_SP_PS_S071I
% 7.74/2.42 # and selection function SelectCQArEqLast.
% 7.74/2.42 #
% 7.74/2.42 # Preprocessing time : 0.023 s
% 7.74/2.42 # Presaturation interreduction done
% 7.74/2.42
% 7.74/2.42 # Proof found!
% 7.74/2.42 # SZS status Theorem
% 7.74/2.42 # SZS output start CNFRefutation
% See solution above
% 7.74/2.42 # Training examples: 0 positive, 0 negative
% 7.74/2.42
% 7.74/2.42 # -------------------------------------------------
% 7.74/2.42 # User time : 0.030 s
% 7.74/2.42 # System time : 0.006 s
% 7.74/2.42 # Total time : 0.037 s
% 7.74/2.42 # Maximum resident set size: 7120 pages
% 7.74/2.42
%------------------------------------------------------------------------------