TSTP Solution File: NUN081+1 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : NUN081+1 : TPTP v8.1.2. Released v7.3.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% Computer : n017.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:56 EDT 2023
% Result : Theorem 0.21s 0.60s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 29
% Syntax : Number of formulae : 49 ( 10 unt; 25 typ; 0 def)
% Number of atoms : 72 ( 0 equ)
% Maximal formula atoms : 8 ( 3 avg)
% Number of connectives : 85 ( 37 ~; 27 |; 21 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 40 ( 24 >; 16 *; 0 +; 0 <<)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-3 aty)
% Number of functors : 20 ( 20 usr; 1 con; 0-2 aty)
% Number of variables : 65 ( 8 sgn; 17 !; 18 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_22,type,
id: ( $i * $i ) > $o ).
tff(decl_23,type,
r1: $i > $o ).
tff(decl_24,type,
r2: ( $i * $i ) > $o ).
tff(decl_25,type,
r3: ( $i * $i * $i ) > $o ).
tff(decl_26,type,
r4: ( $i * $i * $i ) > $o ).
tff(decl_27,type,
esk1_0: $i ).
tff(decl_28,type,
esk2_1: $i > $i ).
tff(decl_29,type,
esk3_2: ( $i * $i ) > $i ).
tff(decl_30,type,
esk4_2: ( $i * $i ) > $i ).
tff(decl_31,type,
esk5_2: ( $i * $i ) > $i ).
tff(decl_32,type,
esk6_2: ( $i * $i ) > $i ).
tff(decl_33,type,
esk7_2: ( $i * $i ) > $i ).
tff(decl_34,type,
esk8_2: ( $i * $i ) > $i ).
tff(decl_35,type,
esk9_2: ( $i * $i ) > $i ).
tff(decl_36,type,
esk10_2: ( $i * $i ) > $i ).
tff(decl_37,type,
esk11_2: ( $i * $i ) > $i ).
tff(decl_38,type,
esk12_2: ( $i * $i ) > $i ).
tff(decl_39,type,
esk13_1: $i > $i ).
tff(decl_40,type,
esk14_1: $i > $i ).
tff(decl_41,type,
esk15_1: $i > $i ).
tff(decl_42,type,
esk16_1: $i > $i ).
tff(decl_43,type,
esk17_1: $i > $i ).
tff(decl_44,type,
esk18_1: $i > $i ).
tff(decl_45,type,
esk19_1: $i > $i ).
tff(decl_46,type,
esk20_1: $i > $i ).
fof(xplusyidthree,conjecture,
? [X63,X46,X47] :
( r3(X63,X46,X47)
& ? [X40] :
( id(X47,X40)
& ? [X41] :
( r2(X41,X40)
& ? [X49] :
( r2(X49,X41)
& ? [X43] :
( r1(X43)
& r2(X43,X49) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',xplusyidthree) ).
fof(axiom_4a,axiom,
! [X54] :
? [X55] :
( id(X55,X54)
& ? [X56] :
( r1(X56)
& r3(X54,X56,X55) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/NUM009+0.ax',axiom_4a) ).
fof(axiom_2,axiom,
! [X3] :
? [X4] :
! [X5] :
( ( id(X5,X4)
& r2(X3,X5) )
| ( ~ r2(X3,X5)
& ~ id(X5,X4) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/NUM009+0.ax',axiom_2) ).
fof(axiom_5,axiom,
! [X14] : id(X14,X14),
file('/export/starexec/sandbox2/benchmark/Axioms/NUM009+0.ax',axiom_5) ).
fof(c_0_4,negated_conjecture,
~ ? [X63,X46,X47] :
( r3(X63,X46,X47)
& ? [X40] :
( id(X47,X40)
& ? [X41] :
( r2(X41,X40)
& ? [X49] :
( r2(X49,X41)
& ? [X43] :
( r1(X43)
& r2(X43,X49) ) ) ) ) ),
inference(assume_negation,[status(cth)],[xplusyidthree]) ).
fof(c_0_5,negated_conjecture,
! [X135,X136,X137,X138,X139,X140,X141] :
( ~ r3(X135,X136,X137)
| ~ id(X137,X138)
| ~ r2(X139,X138)
| ~ r2(X140,X139)
| ~ r1(X141)
| ~ r2(X141,X140) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])]) ).
fof(c_0_6,plain,
! [X121] :
( id(esk13_1(X121),X121)
& r1(esk14_1(X121))
& r3(X121,esk14_1(X121),esk13_1(X121)) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[axiom_4a])]) ).
fof(c_0_7,plain,
! [X3] :
? [X4] :
! [X5] :
( ( id(X5,X4)
& r2(X3,X5) )
| ( ~ r2(X3,X5)
& ~ id(X5,X4) ) ),
inference(fof_simplification,[status(thm)],[axiom_2]) ).
cnf(c_0_8,negated_conjecture,
( ~ r3(X1,X2,X3)
| ~ id(X3,X4)
| ~ r2(X5,X4)
| ~ r2(X6,X5)
| ~ r1(X7)
| ~ r2(X7,X6) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,plain,
r3(X1,esk14_1(X1),esk13_1(X1)),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
fof(c_0_10,plain,
! [X70,X72] :
( ( ~ r2(X70,X72)
| id(X72,esk2_1(X70)) )
& ( ~ id(X72,esk2_1(X70))
| id(X72,esk2_1(X70)) )
& ( ~ r2(X70,X72)
| r2(X70,X72) )
& ( ~ id(X72,esk2_1(X70))
| r2(X70,X72) ) ),
inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[c_0_7])])]) ).
fof(c_0_11,plain,
! [X81] : id(X81,X81),
inference(variable_rename,[status(thm)],[axiom_5]) ).
cnf(c_0_12,negated_conjecture,
( ~ r2(X1,X2)
| ~ r2(X2,X3)
| ~ r2(X3,X4)
| ~ r1(X1)
| ~ id(esk13_1(X5),X4) ),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_13,plain,
id(esk13_1(X1),X1),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_14,plain,
( r2(X2,X1)
| ~ id(X1,esk2_1(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_15,plain,
id(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_16,negated_conjecture,
( ~ r2(X1,X2)
| ~ r2(X2,X3)
| ~ r2(X3,X4)
| ~ r1(X1) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_17,plain,
r2(X1,esk2_1(X1)),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_18,negated_conjecture,
( ~ r2(esk2_1(X1),X2)
| ~ r2(X2,X3)
| ~ r1(X1) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_19,negated_conjecture,
( ~ r2(esk2_1(esk2_1(X1)),X2)
| ~ r1(X1) ),
inference(spm,[status(thm)],[c_0_18,c_0_17]) ).
cnf(c_0_20,plain,
r2(X1,esk13_1(esk2_1(X1))),
inference(spm,[status(thm)],[c_0_14,c_0_13]) ).
cnf(c_0_21,plain,
r1(esk14_1(X1)),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_22,negated_conjecture,
~ r1(X1),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_23,plain,
$false,
inference(sr,[status(thm)],[c_0_21,c_0_22]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : NUN081+1 : TPTP v8.1.2. Released v7.3.0.
% 0.07/0.14 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% 0.13/0.35 % Computer : n017.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Sun Aug 27 08:37:11 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.21/0.58 start to proof: theBenchmark
% 0.21/0.60 % Version : CSE_E---1.5
% 0.21/0.60 % Problem : theBenchmark.p
% 0.21/0.60 % Proof found
% 0.21/0.60 % SZS status Theorem for theBenchmark.p
% 0.21/0.60 % SZS output start Proof
% See solution above
% 0.21/0.60 % Total time : 0.011000 s
% 0.21/0.60 % SZS output end Proof
% 0.21/0.60 % Total time : 0.014000 s
%------------------------------------------------------------------------------