TSTP Solution File: NUM841+1 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : NUM841+1 : TPTP v8.1.2. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% Computer : n025.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.20s 0.65s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 25
% Syntax : Number of formulae : 46 ( 17 unt; 16 typ; 0 def)
% Number of atoms : 46 ( 4 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 29 ( 13 ~; 11 |; 1 &)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 2 ( 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 : 12 ( 12 usr; 5 con; 0-2 aty)
% Number of variables : 32 ( 0 sgn; 20 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_22,type,
vd344: $i ).
tff(decl_23,type,
vd347: $i ).
tff(decl_24,type,
vplus: ( $i * $i ) > $i ).
tff(decl_25,type,
vd345: $i ).
tff(decl_26,type,
vd348: $i ).
tff(decl_27,type,
greater: ( $i * $i ) > $o ).
tff(decl_28,type,
less: ( $i * $i ) > $o ).
tff(decl_29,type,
leq: ( $i * $i ) > $o ).
tff(decl_30,type,
geq: ( $i * $i ) > $o ).
tff(decl_31,type,
vsucc: $i > $i ).
tff(decl_32,type,
v1: $i ).
tff(decl_33,type,
vskolem2: $i > $i ).
tff(decl_34,type,
esk1_2: ( $i * $i ) > $i ).
tff(decl_35,type,
esk2_2: ( $i * $i ) > $i ).
tff(decl_36,type,
esk3_2: ( $i * $i ) > $i ).
tff(decl_37,type,
esk4_2: ( $i * $i ) > $i ).
fof('ass(cond(140, 0), 0)',axiom,
! [X28,X29] :
( greater(X28,X29)
=> less(X29,X28) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','ass(cond(140, 0), 0)') ).
fof('holds(213, 351, 1)',axiom,
greater(vplus(vd347,vd345),vplus(vd348,vd345)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','holds(213, 351, 1)') ).
fof('holds(213, 351, 0)',axiom,
vplus(vd345,vd347) = vplus(vd347,vd345),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','holds(213, 351, 0)') ).
fof('holds(213, 351, 2)',axiom,
vplus(vd348,vd345) = vplus(vd345,vd348),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','holds(213, 351, 2)') ).
fof('ass(cond(168, 0), 0)',axiom,
! [X15,X16,X17] :
( ( less(X16,X17)
& less(X15,X16) )
=> less(X15,X17) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','ass(cond(168, 0), 0)') ).
fof('ass(cond(goal(193), 0), 0)',axiom,
! [X4,X5,X6] :
( less(X4,X5)
=> less(vplus(X4,X6),vplus(X5,X6)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','ass(cond(goal(193), 0), 0)') ).
fof('holds(conjunct1(211), 346, 0)',axiom,
greater(vd344,vd345),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','holds(conjunct1(211), 346, 0)') ).
fof('ass(cond(147, 0), 0)',axiom,
! [X26,X27] :
( less(X26,X27)
=> greater(X27,X26) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','ass(cond(147, 0), 0)') ).
fof('holds(214, 352, 0)',conjecture,
greater(vplus(vd344,vd347),vplus(vd345,vd348)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','holds(214, 352, 0)') ).
fof(c_0_9,plain,
! [X103,X104] :
( ~ greater(X103,X104)
| less(X104,X103) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],['ass(cond(140, 0), 0)'])]) ).
cnf(c_0_10,plain,
greater(vplus(vd347,vd345),vplus(vd348,vd345)),
inference(split_conjunct,[status(thm)],['holds(213, 351, 1)']) ).
cnf(c_0_11,plain,
vplus(vd345,vd347) = vplus(vd347,vd345),
inference(split_conjunct,[status(thm)],['holds(213, 351, 0)']) ).
cnf(c_0_12,plain,
vplus(vd348,vd345) = vplus(vd345,vd348),
inference(split_conjunct,[status(thm)],['holds(213, 351, 2)']) ).
fof(c_0_13,plain,
! [X90,X91,X92] :
( ~ less(X91,X92)
| ~ less(X90,X91)
| less(X90,X92) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],['ass(cond(168, 0), 0)'])]) ).
cnf(c_0_14,plain,
( less(X2,X1)
| ~ greater(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_15,plain,
greater(vplus(vd345,vd347),vplus(vd345,vd348)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_10,c_0_11]),c_0_12]) ).
fof(c_0_16,plain,
! [X73,X74,X75] :
( ~ less(X73,X74)
| less(vplus(X73,X75),vplus(X74,X75)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],['ass(cond(goal(193), 0), 0)'])]) ).
cnf(c_0_17,plain,
greater(vd344,vd345),
inference(split_conjunct,[status(thm)],['holds(conjunct1(211), 346, 0)']) ).
cnf(c_0_18,plain,
( less(X3,X2)
| ~ less(X1,X2)
| ~ less(X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_19,plain,
less(vplus(vd345,vd348),vplus(vd345,vd347)),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_20,plain,
( less(vplus(X1,X3),vplus(X2,X3))
| ~ less(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_21,plain,
less(vd345,vd344),
inference(spm,[status(thm)],[c_0_14,c_0_17]) ).
fof(c_0_22,plain,
! [X101,X102] :
( ~ less(X101,X102)
| greater(X102,X101) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],['ass(cond(147, 0), 0)'])]) ).
cnf(c_0_23,plain,
( less(vplus(vd345,vd348),X1)
| ~ less(vplus(vd345,vd347),X1) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_24,plain,
less(vplus(vd345,X1),vplus(vd344,X1)),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
fof(c_0_25,negated_conjecture,
~ greater(vplus(vd344,vd347),vplus(vd345,vd348)),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],['holds(214, 352, 0)'])]) ).
cnf(c_0_26,plain,
( greater(X2,X1)
| ~ less(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_27,plain,
less(vplus(vd345,vd348),vplus(vd344,vd347)),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_28,negated_conjecture,
~ greater(vplus(vd344,vd347),vplus(vd345,vd348)),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_29,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_28]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : NUM841+1 : TPTP v8.1.2. Released v4.1.0.
% 0.00/0.13 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% 0.16/0.34 % Computer : n025.cluster.edu
% 0.16/0.34 % Model : x86_64 x86_64
% 0.16/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.34 % Memory : 8042.1875MB
% 0.16/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.34 % CPULimit : 300
% 0.16/0.34 % WCLimit : 300
% 0.16/0.34 % DateTime : Fri Aug 25 17:44:22 EDT 2023
% 0.16/0.34 % CPUTime :
% 0.20/0.57 start to proof: theBenchmark
% 0.20/0.65 % Version : CSE_E---1.5
% 0.20/0.65 % Problem : theBenchmark.p
% 0.20/0.65 % Proof found
% 0.20/0.65 % SZS status Theorem for theBenchmark.p
% 0.20/0.65 % SZS output start Proof
% See solution above
% 0.20/0.66 % Total time : 0.076000 s
% 0.20/0.66 % SZS output end Proof
% 0.20/0.66 % Total time : 0.079000 s
%------------------------------------------------------------------------------