TSTP Solution File: NUN067+2 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : NUN067+2 : TPTP v8.1.0. Released v7.3.0.
% Transfm : none
% Format : tptp:raw
% Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% Computer : n025.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:18 EDT 2022
% Result : Theorem 0.18s 0.36s
% Output : CNFRefutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 4
% Syntax : Number of formulae : 19 ( 6 unt; 0 def)
% Number of atoms : 51 ( 23 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 63 ( 31 ~; 21 |; 11 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 1 con; 0-1 aty)
% Number of variables : 34 ( 8 sgn 15 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(nonzerosexist,conjecture,
? [X39] :
! [X22] :
( ~ r1(X22)
| X39 != X22 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',nonzerosexist) ).
fof(axiom_7a,axiom,
! [X41,X42] :
( ! [X43] :
( ~ r1(X43)
| X43 != X42 )
| ~ r2(X41,X42) ),
file('/export/starexec/sandbox2/benchmark/Axioms/NUM008+0.ax',axiom_7a) ).
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_2,axiom,
! [X3] :
? [X4] :
! [X5] :
( ( ~ r2(X3,X5)
& X5 != X4 )
| ( r2(X3,X5)
& X5 = X4 ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/NUM008+0.ax',axiom_2) ).
fof(c_0_4,negated_conjecture,
~ ? [X39] :
! [X22] :
( ~ r1(X22)
| X39 != X22 ),
inference(assume_negation,[status(cth)],[nonzerosexist]) ).
fof(c_0_5,negated_conjecture,
! [X87] :
( r1(esk21_1(X87))
& X87 = esk21_1(X87) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[c_0_4])])])]) ).
fof(c_0_6,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])])]) ).
cnf(c_0_7,negated_conjecture,
r1(esk21_1(X1)),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_8,negated_conjecture,
X1 = esk21_1(X1),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
fof(c_0_9,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])])])]) ).
cnf(c_0_10,plain,
( ~ r1(X1)
| X1 != X2
| ~ r2(X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_11,negated_conjecture,
r1(X1),
inference(rw,[status(thm)],[c_0_7,c_0_8]) ).
fof(c_0_12,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])])])]) ).
cnf(c_0_13,plain,
( X1 = esk1_0
| ~ r1(X1) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_14,negated_conjecture,
( X1 != X2
| ~ r2(X3,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_10,c_0_11])]) ).
cnf(c_0_15,plain,
( r2(X1,X2)
| X2 != esk2_1(X1) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_16,negated_conjecture,
X1 = esk1_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_13,c_0_11])]) ).
cnf(c_0_17,negated_conjecture,
~ r2(X1,X2),
inference(er,[status(thm)],[c_0_14]) ).
cnf(c_0_18,plain,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_15,c_0_16]),c_0_16]),c_0_17]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : NUN067+2 : TPTP v8.1.0. Released v7.3.0.
% 0.03/0.12 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.12/0.33 % Computer : n025.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 04:43:59 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.36 # No SInE strategy applied
% 0.18/0.36 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S4b
% 0.18/0.36 # and selection function SelectCQIPrecW.
% 0.18/0.36 #
% 0.18/0.36 # Presaturation interreduction done
% 0.18/0.36
% 0.18/0.36 # Proof found!
% 0.18/0.36 # SZS status Theorem
% 0.18/0.36 # SZS output start CNFRefutation
% See solution above
% 0.18/0.36 # Training examples: 0 positive, 0 negative
%------------------------------------------------------------------------------