TSTP Solution File: NUM840+2 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : NUM840+2 : 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 : n016.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:56 EDT 2023
% Result : Theorem 0.68s 0.82s
% Output : CNFRefutation 0.68s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 21
% Syntax : Number of formulae : 49 ( 14 unt; 12 typ; 0 def)
% Number of atoms : 64 ( 12 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 57 ( 30 ~; 24 |; 0 &)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 15 ( 8 >; 7 *; 0 +; 0 <<)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 4 con; 0-2 aty)
% Number of variables : 57 ( 0 sgn; 34 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_22,type,
vd328: $i ).
tff(decl_23,type,
vd329: $i ).
tff(decl_24,type,
less: ( $i * $i ) > $o ).
tff(decl_25,type,
vd330: $i ).
tff(decl_26,type,
vplus: ( $i * $i ) > $i ).
tff(decl_27,type,
greater: ( $i * $i ) > $o ).
tff(decl_28,type,
vsucc: $i > $i ).
tff(decl_29,type,
v1: $i ).
tff(decl_30,type,
esk1_2: ( $i * $i ) > $i ).
tff(decl_31,type,
esk2_2: ( $i * $i ) > $i ).
tff(decl_32,type,
esk3_2: ( $i * $i ) > $i ).
tff(decl_33,type,
esk4_2: ( $i * $i ) > $i ).
fof('ass(cond(goal(130), 0), 2)',axiom,
! [X8,X9] :
( ~ greater(X8,X9)
| ~ less(X8,X9) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','ass(cond(goal(130), 0), 2)') ).
fof('ass(cond(147, 0), 0)',axiom,
! [X4,X5] :
( less(X4,X5)
=> greater(X5,X4) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','ass(cond(147, 0), 0)') ).
fof('ass(cond(61, 0), 0)',axiom,
! [X25,X26] : vplus(X26,X25) = vplus(X25,X26),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','ass(cond(61, 0), 0)') ).
fof('holds(antec(conjunct2(conjunct2(204))), 335, 0)',axiom,
less(vplus(vd328,vd330),vplus(vd329,vd330)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','holds(antec(conjunct2(conjunct2(204))), 335, 0)') ).
fof('ass(cond(goal(193), 0), 0)',axiom,
! [X1,X2,X3] :
( less(X1,X2)
=> less(vplus(X1,X3),vplus(X2,X3)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','ass(cond(goal(193), 0), 0)') ).
fof('ass(cond(140, 0), 0)',axiom,
! [X6,X7] :
( greater(X6,X7)
=> less(X7,X6) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','ass(cond(140, 0), 0)') ).
fof('ass(cond(goal(130), 0), 0)',axiom,
! [X8,X9] :
( X8 = X9
| greater(X8,X9)
| less(X8,X9) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','ass(cond(goal(130), 0), 0)') ).
fof('ass(cond(goal(130), 0), 1)',axiom,
! [X8,X9] :
( X8 != X9
| ~ less(X8,X9) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','ass(cond(goal(130), 0), 1)') ).
fof('holds(conseq(conjunct2(conjunct2(204))), 336, 0)',conjecture,
less(vd328,vd329),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','holds(conseq(conjunct2(conjunct2(204))), 336, 0)') ).
fof(c_0_9,plain,
! [X8,X9] :
( ~ greater(X8,X9)
| ~ less(X8,X9) ),
inference(fof_simplification,[status(thm)],['ass(cond(goal(130), 0), 2)']) ).
fof(c_0_10,plain,
! [X52,X53] :
( ~ greater(X52,X53)
| ~ less(X52,X53) ),
inference(variable_rename,[status(thm)],[c_0_9]) ).
fof(c_0_11,plain,
! [X44,X45] :
( ~ less(X44,X45)
| greater(X45,X44) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],['ass(cond(147, 0), 0)'])]) ).
fof(c_0_12,plain,
! [X87,X88] : vplus(X88,X87) = vplus(X87,X88),
inference(variable_rename,[status(thm)],['ass(cond(61, 0), 0)']) ).
cnf(c_0_13,plain,
( ~ greater(X1,X2)
| ~ less(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_14,plain,
( greater(X2,X1)
| ~ less(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_15,plain,
less(vplus(vd328,vd330),vplus(vd329,vd330)),
inference(split_conjunct,[status(thm)],['holds(antec(conjunct2(conjunct2(204))), 335, 0)']) ).
cnf(c_0_16,plain,
vplus(X1,X2) = vplus(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_17,plain,
! [X35,X36,X37] :
( ~ less(X35,X36)
| less(vplus(X35,X37),vplus(X36,X37)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],['ass(cond(goal(193), 0), 0)'])]) ).
cnf(c_0_18,plain,
( ~ less(X1,X2)
| ~ less(X2,X1) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_19,plain,
less(vplus(vd328,vd330),vplus(vd330,vd329)),
inference(rw,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_20,plain,
( less(vplus(X1,X3),vplus(X2,X3))
| ~ less(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
fof(c_0_21,plain,
! [X46,X47] :
( ~ greater(X46,X47)
| less(X47,X46) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],['ass(cond(140, 0), 0)'])]) ).
fof(c_0_22,plain,
! [X48,X49] :
( X48 = X49
| greater(X48,X49)
| less(X48,X49) ),
inference(variable_rename,[status(thm)],['ass(cond(goal(130), 0), 0)']) ).
fof(c_0_23,plain,
! [X8,X9] :
( X8 != X9
| ~ less(X8,X9) ),
inference(fof_simplification,[status(thm)],['ass(cond(goal(130), 0), 1)']) ).
cnf(c_0_24,plain,
~ less(vplus(vd330,vd329),vplus(vd328,vd330)),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_25,plain,
( less(vplus(X1,X2),vplus(X3,X1))
| ~ less(X2,X3) ),
inference(spm,[status(thm)],[c_0_20,c_0_16]) ).
cnf(c_0_26,plain,
( less(X2,X1)
| ~ greater(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_27,plain,
( X1 = X2
| greater(X1,X2)
| less(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
fof(c_0_28,negated_conjecture,
~ less(vd328,vd329),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],['holds(conseq(conjunct2(conjunct2(204))), 336, 0)'])]) ).
fof(c_0_29,plain,
! [X50,X51] :
( X50 != X51
| ~ less(X50,X51) ),
inference(variable_rename,[status(thm)],[c_0_23]) ).
cnf(c_0_30,plain,
~ less(vd329,vd328),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_31,plain,
( X1 = X2
| less(X1,X2)
| less(X2,X1) ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_32,negated_conjecture,
~ less(vd328,vd329),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_33,plain,
( X1 != X2
| ~ less(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
cnf(c_0_34,plain,
vd329 = vd328,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_32]) ).
cnf(c_0_35,plain,
~ less(X1,X1),
inference(er,[status(thm)],[c_0_33]) ).
cnf(c_0_36,plain,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_34]),c_0_16]),c_0_35]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : NUM840+2 : 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.34 % Computer : n016.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Fri Aug 25 08:42:55 EDT 2023
% 0.14/0.35 % CPUTime :
% 0.20/0.58 start to proof: theBenchmark
% 0.68/0.82 % Version : CSE_E---1.5
% 0.68/0.82 % Problem : theBenchmark.p
% 0.68/0.82 % Proof found
% 0.68/0.82 % SZS status Theorem for theBenchmark.p
% 0.68/0.82 % SZS output start Proof
% See solution above
% 0.68/0.83 % Total time : 0.228000 s
% 0.68/0.83 % SZS output end Proof
% 0.68/0.83 % Total time : 0.231000 s
%------------------------------------------------------------------------------