TSTP Solution File: NUM843+1 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : NUM843+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 : n014.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:57 EDT 2023
% Result : Theorem 0.19s 0.61s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 18
% Syntax : Number of formulae : 31 ( 9 unt; 14 typ; 0 def)
% Number of atoms : 35 ( 9 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 28 ( 10 ~; 15 |; 2 &)
% ( 1 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 1 ( 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 : 10 ( 10 usr; 3 con; 0-2 aty)
% Number of variables : 17 ( 0 sgn; 8 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_22,type,
vd390: $i ).
tff(decl_23,type,
vd391: $i ).
tff(decl_24,type,
greater: ( $i * $i ) > $o ).
tff(decl_25,type,
leq: ( $i * $i ) > $o ).
tff(decl_26,type,
v1: $i ).
tff(decl_27,type,
vplus: ( $i * $i ) > $i ).
tff(decl_28,type,
less: ( $i * $i ) > $o ).
tff(decl_29,type,
geq: ( $i * $i ) > $o ).
tff(decl_30,type,
vsucc: $i > $i ).
tff(decl_31,type,
vskolem2: $i > $i ).
tff(decl_32,type,
esk1_2: ( $i * $i ) > $i ).
tff(decl_33,type,
esk2_2: ( $i * $i ) > $i ).
tff(decl_34,type,
esk3_2: ( $i * $i ) > $i ).
tff(decl_35,type,
esk4_2: ( $i * $i ) > $i ).
fof('def(cond(conseq(axiom(3)), 17), 1)',axiom,
! [X37,X38] :
( leq(X38,X37)
<=> ( less(X38,X37)
| X38 = X37 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','def(cond(conseq(axiom(3)), 17), 1)') ).
fof('ass(cond(goal(130), 0), 0)',axiom,
! [X45,X46] :
( X45 = X46
| greater(X45,X46)
| less(X45,X46) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','ass(cond(goal(130), 0), 0)') ).
fof('holds(conjunct2(243), 393, 0)',axiom,
~ leq(vd390,vd391),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','holds(conjunct2(243), 393, 0)') ).
fof('holds(244, 394, 0)',conjecture,
greater(vd390,vd391),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','holds(244, 394, 0)') ).
fof(c_0_4,plain,
! [X127,X128] :
( ( ~ leq(X128,X127)
| less(X128,X127)
| X128 = X127 )
& ( ~ less(X128,X127)
| leq(X128,X127) )
& ( X128 != X127
| leq(X128,X127) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],['def(cond(conseq(axiom(3)), 17), 1)'])])]) ).
fof(c_0_5,plain,
! [X135,X136] :
( X135 = X136
| greater(X135,X136)
| less(X135,X136) ),
inference(variable_rename,[status(thm)],['ass(cond(goal(130), 0), 0)']) ).
fof(c_0_6,plain,
~ leq(vd390,vd391),
inference(fof_simplification,[status(thm)],['holds(conjunct2(243), 393, 0)']) ).
cnf(c_0_7,plain,
( leq(X1,X2)
| ~ less(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_8,plain,
( X1 = X2
| greater(X1,X2)
| less(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
fof(c_0_9,negated_conjecture,
~ greater(vd390,vd391),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],['holds(244, 394, 0)'])]) ).
cnf(c_0_10,plain,
~ leq(vd390,vd391),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_11,plain,
( X1 = X2
| leq(X1,X2)
| greater(X1,X2) ),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_12,negated_conjecture,
~ greater(vd390,vd391),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_13,plain,
( leq(X1,X2)
| X1 != X2 ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_14,plain,
vd391 = vd390,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_12]) ).
cnf(c_0_15,plain,
leq(X1,X1),
inference(er,[status(thm)],[c_0_13]) ).
cnf(c_0_16,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_10,c_0_14]),c_0_15])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : NUM843+1 : TPTP v8.1.2. Released v4.1.0.
% 0.07/0.13 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% 0.13/0.34 % Computer : n014.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 : Fri Aug 25 15:35:33 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.19/0.56 start to proof: theBenchmark
% 0.19/0.61 % Version : CSE_E---1.5
% 0.19/0.61 % Problem : theBenchmark.p
% 0.19/0.61 % Proof found
% 0.19/0.61 % SZS status Theorem for theBenchmark.p
% 0.19/0.61 % SZS output start Proof
% See solution above
% 0.19/0.61 % Total time : 0.035000 s
% 0.19/0.61 % SZS output end Proof
% 0.19/0.61 % Total time : 0.038000 s
%------------------------------------------------------------------------------