TSTP Solution File: NUM854+1 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : NUM854+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 : n012.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:41:03 EDT 2023
% Result : Theorem 0.20s 0.60s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 21
% Syntax : Number of formulae : 33 ( 13 unt; 17 typ; 0 def)
% Number of atoms : 19 ( 3 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 8 ( 5 ~; 2 |; 0 &)
% ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 22 ( 12 >; 10 *; 0 +; 0 <<)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 13 ( 13 usr; 5 con; 0-2 aty)
% Number of variables : 18 ( 0 sgn; 10 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_22,type,
vd508: $i ).
tff(decl_23,type,
vd511: $i ).
tff(decl_24,type,
vmul: ( $i * $i ) > $i ).
tff(decl_25,type,
vd509: $i ).
tff(decl_26,type,
greater: ( $i * $i ) > $o ).
tff(decl_27,type,
vd512: $i ).
tff(decl_28,type,
less: ( $i * $i ) > $o ).
tff(decl_29,type,
vplus: ( $i * $i ) > $i ).
tff(decl_30,type,
vsucc: $i > $i ).
tff(decl_31,type,
v1: $i ).
tff(decl_32,type,
leq: ( $i * $i ) > $o ).
tff(decl_33,type,
geq: ( $i * $i ) > $o ).
tff(decl_34,type,
vskolem2: $i > $i ).
tff(decl_35,type,
esk1_2: ( $i * $i ) > $i ).
tff(decl_36,type,
esk2_2: ( $i * $i ) > $i ).
tff(decl_37,type,
esk3_2: ( $i * $i ) > $i ).
tff(decl_38,type,
esk4_2: ( $i * $i ) > $i ).
fof('ass(cond(299, 0), 2)',axiom,
! [X10,X15,X16] :
( greater(X15,X16)
=> greater(vmul(X15,X10),vmul(X16,X10)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','ass(cond(299, 0), 2)') ).
fof('holds(conjunct1(314), 510, 0)',axiom,
greater(vd508,vd509),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','holds(conjunct1(314), 510, 0)') ).
fof('ass(cond(270, 0), 0)',axiom,
! [X23,X24] : vmul(X23,X24) = vmul(X24,X23),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','ass(cond(270, 0), 0)') ).
fof('holds(conjunct1(315), 514, 0)',conjecture,
greater(vmul(vd508,vd511),vmul(vd509,vd511)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','holds(conjunct1(315), 514, 0)') ).
fof(c_0_4,plain,
! [X125,X126,X127] :
( ~ greater(X126,X127)
| greater(vmul(X126,X125),vmul(X127,X125)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],['ass(cond(299, 0), 2)'])]) ).
cnf(c_0_5,plain,
( greater(vmul(X1,X3),vmul(X2,X3))
| ~ greater(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_6,plain,
greater(vd508,vd509),
inference(split_conjunct,[status(thm)],['holds(conjunct1(314), 510, 0)']) ).
fof(c_0_7,plain,
! [X134,X135] : vmul(X134,X135) = vmul(X135,X134),
inference(variable_rename,[status(thm)],['ass(cond(270, 0), 0)']) ).
fof(c_0_8,negated_conjecture,
~ greater(vmul(vd508,vd511),vmul(vd509,vd511)),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],['holds(conjunct1(315), 514, 0)'])]) ).
cnf(c_0_9,plain,
greater(vmul(vd508,X1),vmul(vd509,X1)),
inference(spm,[status(thm)],[c_0_5,c_0_6]) ).
cnf(c_0_10,plain,
vmul(X1,X2) = vmul(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_11,negated_conjecture,
~ greater(vmul(vd508,vd511),vmul(vd509,vd511)),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_12,plain,
greater(vmul(vd508,X1),vmul(X1,vd509)),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_13,negated_conjecture,
~ greater(vmul(vd511,vd508),vmul(vd511,vd509)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_11,c_0_10]),c_0_10]) ).
cnf(c_0_14,plain,
greater(vmul(X1,vd508),vmul(X1,vd509)),
inference(spm,[status(thm)],[c_0_12,c_0_10]) ).
cnf(c_0_15,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_13,c_0_14])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : NUM854+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.13/0.34 % Computer : n012.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.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Fri Aug 25 14:49:11 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.20/0.57 start to proof: theBenchmark
% 0.20/0.60 % Version : CSE_E---1.5
% 0.20/0.60 % Problem : theBenchmark.p
% 0.20/0.60 % Proof found
% 0.20/0.60 % SZS status Theorem for theBenchmark.p
% 0.20/0.60 % SZS output start Proof
% See solution above
% 0.20/0.60 % Total time : 0.018000 s
% 0.20/0.60 % SZS output end Proof
% 0.20/0.60 % Total time : 0.020000 s
%------------------------------------------------------------------------------