TSTP Solution File: NUN069+2 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : NUN069+2 : TPTP v8.1.2. Released v7.3.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% Computer : n022.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 : Thu Aug 31 12:45:51 EDT 2023
% Result : Theorem 0.19s 0.55s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 27
% Syntax : Number of formulae : 41 ( 4 unt; 24 typ; 0 def)
% Number of atoms : 54 ( 21 equ)
% Maximal formula atoms : 8 ( 3 avg)
% Number of connectives : 64 ( 27 ~; 19 |; 18 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 38 ( 23 >; 15 *; 0 +; 0 <<)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-3 aty)
% Number of functors : 20 ( 20 usr; 1 con; 0-2 aty)
% Number of variables : 28 ( 3 sgn; 11 !; 8 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_22,type,
r1: $i > $o ).
tff(decl_23,type,
r2: ( $i * $i ) > $o ).
tff(decl_24,type,
r3: ( $i * $i * $i ) > $o ).
tff(decl_25,type,
r4: ( $i * $i * $i ) > $o ).
tff(decl_26,type,
esk1_0: $i ).
tff(decl_27,type,
esk2_1: $i > $i ).
tff(decl_28,type,
esk3_2: ( $i * $i ) > $i ).
tff(decl_29,type,
esk4_2: ( $i * $i ) > $i ).
tff(decl_30,type,
esk5_2: ( $i * $i ) > $i ).
tff(decl_31,type,
esk6_2: ( $i * $i ) > $i ).
tff(decl_32,type,
esk7_2: ( $i * $i ) > $i ).
tff(decl_33,type,
esk8_2: ( $i * $i ) > $i ).
tff(decl_34,type,
esk9_2: ( $i * $i ) > $i ).
tff(decl_35,type,
esk10_2: ( $i * $i ) > $i ).
tff(decl_36,type,
esk11_2: ( $i * $i ) > $i ).
tff(decl_37,type,
esk12_2: ( $i * $i ) > $i ).
tff(decl_38,type,
esk13_1: $i > $i ).
tff(decl_39,type,
esk14_1: $i > $i ).
tff(decl_40,type,
esk15_1: $i > $i ).
tff(decl_41,type,
esk16_1: $i > $i ).
tff(decl_42,type,
esk17_1: $i > $i ).
tff(decl_43,type,
esk18_1: $i > $i ).
tff(decl_44,type,
esk19_1: $i > $i ).
tff(decl_45,type,
esk20_1: $i > $i ).
fof(oneeqone,conjecture,
? [X39] :
( X39 = X39
& ? [X22] :
( r1(X22)
& r2(X22,X39) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',oneeqone) ).
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_1,axiom,
? [X1] :
! [X2] :
( ( ~ r1(X2)
& X2 != X1 )
| ( r1(X2)
& X2 = X1 ) ),
file('/export/starexec/sandbox/benchmark/Axioms/NUM008+0.ax',axiom_1) ).
fof(c_0_3,negated_conjecture,
~ ? [X39] :
( X39 = X39
& ? [X22] :
( r1(X22)
& r2(X22,X39) ) ),
inference(assume_negation,[status(cth)],[oneeqone]) ).
fof(c_0_4,plain,
! [X3] :
? [X4] :
! [X5] :
( ( ~ r2(X3,X5)
& X5 != X4 )
| ( r2(X3,X5)
& X5 = X4 ) ),
inference(fof_simplification,[status(thm)],[axiom_2]) ).
fof(c_0_5,plain,
? [X1] :
! [X2] :
( ( ~ r1(X2)
& X2 != X1 )
| ( r1(X2)
& X2 = X1 ) ),
inference(fof_simplification,[status(thm)],[axiom_1]) ).
fof(c_0_6,negated_conjecture,
! [X87,X88] :
( X87 != X87
| ~ r1(X88)
| ~ r2(X88,X87) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])]) ).
fof(c_0_7,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)],[c_0_4])])]) ).
fof(c_0_8,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)],[c_0_5])])]) ).
cnf(c_0_9,negated_conjecture,
( $false
| ~ r1(X2)
| ~ r2(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,plain,
( r2(X1,X2)
| X2 != esk2_1(X1) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_11,plain,
( r1(X1)
| X1 != esk1_0 ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_12,negated_conjecture,
( ~ r1(X2)
| ~ r2(X2,X1) ),
inference(cn,[status(thm)],[c_0_9]) ).
cnf(c_0_13,plain,
r2(X1,esk2_1(X1)),
inference(er,[status(thm)],[c_0_10]) ).
cnf(c_0_14,plain,
r1(esk1_0),
inference(er,[status(thm)],[c_0_11]) ).
cnf(c_0_15,negated_conjecture,
~ r1(X1),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_16,plain,
$false,
inference(sr,[status(thm)],[c_0_14,c_0_15]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : NUN069+2 : TPTP v8.1.2. Released v7.3.0.
% 0.00/0.12 % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% 0.12/0.33 % Computer : n022.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.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Sun Aug 27 09:15:09 EDT 2023
% 0.12/0.34 % CPUTime :
% 0.19/0.53 start to proof: theBenchmark
% 0.19/0.55 % Version : CSE_E---1.5
% 0.19/0.55 % Problem : theBenchmark.p
% 0.19/0.55 % Proof found
% 0.19/0.55 % SZS status Theorem for theBenchmark.p
% 0.19/0.55 % SZS output start Proof
% See solution above
% 0.19/0.55 % Total time : 0.006000 s
% 0.19/0.55 % SZS output end Proof
% 0.19/0.55 % Total time : 0.009000 s
%------------------------------------------------------------------------------