TSTP Solution File: NUN080+1 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : NUN080+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 : n008.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:55 EDT 2023
% Result : Theorem 0.20s 0.58s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 31
% Syntax : Number of formulae : 55 ( 11 unt; 25 typ; 0 def)
% Number of atoms : 82 ( 0 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 86 ( 34 ~; 25 |; 27 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 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 : 75 ( 8 sgn; 26 !; 20 ?; 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(xplustwoidy,conjecture,
? [X63,X46,X47] :
( id(X47,X46)
& ? [X40] :
( r3(X63,X40,X47)
& ? [X41] :
( r2(X41,X40)
& ? [X49] :
( r1(X49)
& r2(X49,X41) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',xplustwoidy) ).
fof(axiom_6,axiom,
! [X15,X16] :
( ~ id(X15,X16)
| id(X16,X15) ),
file('/export/starexec/sandbox2/benchmark/Axioms/NUM009+0.ax',axiom_6) ).
fof(axiom_1a,axiom,
! [X38,X39] :
? [X40] :
( ? [X41] :
( id(X41,X40)
& ? [X42] :
( r2(X39,X42)
& r3(X38,X42,X41) ) )
& ? [X43] :
( r2(X43,X40)
& r3(X38,X39,X43) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/NUM009+0.ax',axiom_1a) ).
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_6,negated_conjecture,
~ ? [X63,X46,X47] :
( id(X47,X46)
& ? [X40] :
( r3(X63,X40,X47)
& ? [X41] :
( r2(X41,X40)
& ? [X49] :
( r1(X49)
& r2(X49,X41) ) ) ) ),
inference(assume_negation,[status(cth)],[xplustwoidy]) ).
fof(c_0_7,plain,
! [X15,X16] :
( ~ id(X15,X16)
| id(X16,X15) ),
inference(fof_simplification,[status(thm)],[axiom_6]) ).
fof(c_0_8,negated_conjecture,
! [X135,X136,X137,X138,X139,X140] :
( ~ id(X137,X136)
| ~ r3(X135,X138,X137)
| ~ r2(X139,X138)
| ~ r1(X140)
| ~ r2(X140,X139) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])]) ).
fof(c_0_9,plain,
! [X105,X106] :
( id(esk6_2(X105,X106),esk5_2(X105,X106))
& r2(X106,esk7_2(X105,X106))
& r3(X105,esk7_2(X105,X106),esk6_2(X105,X106))
& r2(esk8_2(X105,X106),esk5_2(X105,X106))
& r3(X105,X106,esk8_2(X105,X106)) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[axiom_1a])]) ).
fof(c_0_10,plain,
! [X82,X83] :
( ~ id(X82,X83)
| id(X83,X82) ),
inference(variable_rename,[status(thm)],[c_0_7]) ).
fof(c_0_11,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_12,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_13,negated_conjecture,
( ~ id(X1,X2)
| ~ r3(X3,X4,X1)
| ~ r2(X5,X4)
| ~ r1(X6)
| ~ r2(X6,X5) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_14,plain,
r3(X1,X2,esk8_2(X1,X2)),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_15,plain,
( id(X2,X1)
| ~ id(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_16,plain,
id(esk13_1(X1),X1),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_17,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_12])])]) ).
fof(c_0_18,plain,
! [X81] : id(X81,X81),
inference(variable_rename,[status(thm)],[axiom_5]) ).
cnf(c_0_19,negated_conjecture,
( ~ r2(X1,X2)
| ~ r2(X2,X3)
| ~ r1(X1)
| ~ id(esk8_2(X4,X3),X5) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_20,plain,
id(X1,esk13_1(X1)),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_21,plain,
( r2(X2,X1)
| ~ id(X1,esk2_1(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_22,plain,
id(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_23,negated_conjecture,
( ~ r2(X1,X2)
| ~ r2(X2,X3)
| ~ r1(X1) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_24,plain,
r2(X1,esk2_1(X1)),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_25,negated_conjecture,
( ~ r2(esk2_1(X1),X2)
| ~ r1(X1) ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_26,plain,
r2(X1,esk13_1(esk2_1(X1))),
inference(spm,[status(thm)],[c_0_21,c_0_16]) ).
cnf(c_0_27,plain,
r1(esk14_1(X1)),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_28,negated_conjecture,
~ r1(X1),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_29,plain,
$false,
inference(sr,[status(thm)],[c_0_27,c_0_28]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : NUN080+1 : TPTP v8.1.2. Released v7.3.0.
% 0.00/0.13 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% 0.13/0.34 % Computer : n008.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 : 300
% 0.13/0.34 % DateTime : Sun Aug 27 09:27:02 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.20/0.56 start to proof: theBenchmark
% 0.20/0.58 % Version : CSE_E---1.5
% 0.20/0.58 % Problem : theBenchmark.p
% 0.20/0.58 % Proof found
% 0.20/0.58 % SZS status Theorem for theBenchmark.p
% 0.20/0.58 % SZS output start Proof
% See solution above
% 0.20/0.59 % Total time : 0.013000 s
% 0.20/0.59 % SZS output end Proof
% 0.20/0.59 % Total time : 0.016000 s
%------------------------------------------------------------------------------