TSTP Solution File: NUM839+1 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : NUM839+1 : TPTP v8.1.2. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% Computer : n020.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 10:40:55 EDT 2023
% Result : Theorem 0.21s 0.64s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 24
% Syntax : Number of formulae : 58 ( 27 unt; 15 typ; 0 def)
% Number of atoms : 64 ( 39 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 45 ( 24 ~; 18 |; 1 &)
% ( 1 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 3 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 20 ( 11 >; 9 *; 0 +; 0 <<)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 4 con; 0-2 aty)
% Number of variables : 73 ( 12 sgn; 34 !; 2 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_22,type,
vd328: $i ).
tff(decl_23,type,
vd329: $i ).
tff(decl_24,type,
greater: ( $i * $i ) > $o ).
tff(decl_25,type,
vd330: $i ).
tff(decl_26,type,
vplus: ( $i * $i ) > $i ).
tff(decl_27,type,
less: ( $i * $i ) > $o ).
tff(decl_28,type,
leq: ( $i * $i ) > $o ).
tff(decl_29,type,
geq: ( $i * $i ) > $o ).
tff(decl_30,type,
vsucc: $i > $i ).
tff(decl_31,type,
v1: $i ).
tff(decl_32,type,
vskolem2: $i > $i ).
tff(decl_33,type,
esk1_2: ( $i * $i ) > $i ).
tff(decl_34,type,
esk2_2: ( $i * $i ) > $i ).
tff(decl_35,type,
esk3_2: ( $i * $i ) > $i ).
tff(decl_36,type,
esk4_2: ( $i * $i ) > $i ).
fof('ass(cond(73, 0), 0)',axiom,
! [X42,X43] : X43 != vplus(X42,X43),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','ass(cond(73, 0), 0)') ).
fof('ass(cond(33, 0), 0)',axiom,
! [X49,X50,X51] : vplus(vplus(X49,X50),X51) = vplus(X49,vplus(X50,X51)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','ass(cond(33, 0), 0)') ).
fof('ass(cond(61, 0), 0)',axiom,
! [X44,X45] : vplus(X45,X44) = vplus(X44,X45),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','ass(cond(61, 0), 0)') ).
fof('holds(conseq(204), 332, 0)',conjecture,
greater(vd328,vd329),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','holds(conseq(204), 332, 0)') ).
fof('ass(cond(goal(130), 0), 0)',axiom,
! [X27,X28] :
( X27 = X28
| greater(X27,X28)
| less(X27,X28) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','ass(cond(goal(130), 0), 0)') ).
fof('def(cond(conseq(axiom(3)), 11), 1)',axiom,
! [X32,X33] :
( greater(X33,X32)
<=> ? [X34] : X33 = vplus(X32,X34) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','def(cond(conseq(axiom(3)), 11), 1)') ).
fof('holds(antec(204), 331, 0)',axiom,
greater(vplus(vd328,vd330),vplus(vd329,vd330)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','holds(antec(204), 331, 0)') ).
fof('ass(cond(147, 0), 0)',axiom,
! [X23,X24] :
( less(X23,X24)
=> greater(X24,X23) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','ass(cond(147, 0), 0)') ).
fof('ass(cond(goal(88), 0), 1)',axiom,
! [X35,X36] :
( X35 != X36
| ~ ? [X38] : X36 = vplus(X35,X38) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','ass(cond(goal(88), 0), 1)') ).
fof(c_0_9,plain,
! [X130,X131] : X131 != vplus(X130,X131),
inference(variable_rename,[status(thm)],['ass(cond(73, 0), 0)']) ).
fof(c_0_10,plain,
! [X137,X138,X139] : vplus(vplus(X137,X138),X139) = vplus(X137,vplus(X138,X139)),
inference(variable_rename,[status(thm)],['ass(cond(33, 0), 0)']) ).
cnf(c_0_11,plain,
X1 != vplus(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_12,plain,
vplus(vplus(X1,X2),X3) = vplus(X1,vplus(X2,X3)),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_13,plain,
! [X132,X133] : vplus(X133,X132) = vplus(X132,X133),
inference(variable_rename,[status(thm)],['ass(cond(61, 0), 0)']) ).
fof(c_0_14,negated_conjecture,
~ greater(vd328,vd329),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],['holds(conseq(204), 332, 0)'])]) ).
fof(c_0_15,plain,
! [X93,X94] :
( X93 = X94
| greater(X93,X94)
| less(X93,X94) ),
inference(variable_rename,[status(thm)],['ass(cond(goal(130), 0), 0)']) ).
cnf(c_0_16,plain,
vplus(X1,vplus(X2,X3)) != X3,
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_17,plain,
vplus(X1,X2) = vplus(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
fof(c_0_18,plain,
! [X107,X108,X110,X111,X112] :
( ( ~ greater(X108,X107)
| X108 = vplus(X107,esk2_2(X107,X108)) )
& ( X111 != vplus(X110,X112)
| greater(X111,X110) ) ),
inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],['def(cond(conseq(axiom(3)), 11), 1)'])])])])]) ).
cnf(c_0_19,plain,
greater(vplus(vd328,vd330),vplus(vd329,vd330)),
inference(split_conjunct,[status(thm)],['holds(antec(204), 331, 0)']) ).
fof(c_0_20,plain,
! [X89,X90] :
( ~ less(X89,X90)
| greater(X90,X89) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],['ass(cond(147, 0), 0)'])]) ).
cnf(c_0_21,negated_conjecture,
~ greater(vd328,vd329),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_22,plain,
( X1 = X2
| greater(X1,X2)
| less(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
fof(c_0_23,plain,
! [X117,X118,X119] :
( X117 != X118
| X118 != vplus(X117,X119) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],['ass(cond(goal(88), 0), 1)'])])]) ).
cnf(c_0_24,plain,
vplus(X1,vplus(X2,X3)) != X2,
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_25,plain,
( X1 = vplus(X2,esk2_2(X2,X1))
| ~ greater(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_26,plain,
greater(vplus(vd328,vd330),vplus(vd330,vd329)),
inference(rw,[status(thm)],[c_0_19,c_0_17]) ).
cnf(c_0_27,plain,
( greater(X2,X1)
| ~ less(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_28,negated_conjecture,
( vd329 = vd328
| less(vd328,vd329) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_29,plain,
( X1 != X2
| X2 != vplus(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_30,plain,
vplus(X1,vplus(X2,vplus(X3,X4))) != vplus(X2,X3),
inference(spm,[status(thm)],[c_0_24,c_0_12]) ).
cnf(c_0_31,plain,
vplus(vd330,vplus(vd329,esk2_2(vplus(vd330,vd329),vplus(vd328,vd330)))) = vplus(vd328,vd330),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_12]) ).
cnf(c_0_32,negated_conjecture,
( vd329 = vd328
| greater(vd329,vd328) ),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_33,plain,
vplus(X1,X2) != X1,
inference(er,[status(thm)],[c_0_29]) ).
cnf(c_0_34,plain,
vplus(X1,vplus(vd328,vd330)) != vplus(vd330,vd329),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_35,plain,
vplus(X1,vplus(X2,X3)) = vplus(X2,vplus(X1,X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_17]),c_0_12]) ).
cnf(c_0_36,negated_conjecture,
( vplus(vd328,esk2_2(vd328,vd329)) = vd329
| vd329 = vd328 ),
inference(spm,[status(thm)],[c_0_25,c_0_32]) ).
cnf(c_0_37,plain,
vplus(X1,vplus(X2,X3)) != vplus(X1,X2),
inference(spm,[status(thm)],[c_0_33,c_0_12]) ).
cnf(c_0_38,plain,
vplus(vd328,vplus(X1,vd330)) != vplus(vd330,vd329),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_39,negated_conjecture,
( vplus(vd328,vplus(esk2_2(vd328,vd329),X1)) = vplus(vd329,X1)
| vd329 = vd328 ),
inference(spm,[status(thm)],[c_0_12,c_0_36]) ).
cnf(c_0_40,plain,
vplus(vd330,vd329) != vplus(vd328,vd330),
inference(spm,[status(thm)],[c_0_37,c_0_31]) ).
cnf(c_0_41,negated_conjecture,
vd329 = vd328,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_17])]) ).
cnf(c_0_42,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_40,c_0_41]),c_0_17])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : NUM839+1 : TPTP v8.1.2. Released v4.1.0.
% 0.00/0.13 % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% 0.14/0.35 % Computer : n020.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Fri Aug 25 12:02:15 EDT 2023
% 0.14/0.35 % CPUTime :
% 0.21/0.57 start to proof: theBenchmark
% 0.21/0.64 % Version : CSE_E---1.5
% 0.21/0.64 % Problem : theBenchmark.p
% 0.21/0.64 % Proof found
% 0.21/0.64 % SZS status Theorem for theBenchmark.p
% 0.21/0.64 % SZS output start Proof
% See solution above
% 0.21/0.64 % Total time : 0.055000 s
% 0.21/0.64 % SZS output end Proof
% 0.21/0.64 % Total time : 0.058000 s
%------------------------------------------------------------------------------