TSTP Solution File: ANA003-2 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : ANA003-2 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% Computer : n027.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 : Wed Aug 30 17:13:46 EDT 2023
% Result : Unsatisfiable 2.39s 2.44s
% Output : CNFRefutation 2.39s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 30
% Syntax : Number of formulae : 54 ( 4 unt; 17 typ; 0 def)
% Number of atoms : 98 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 128 ( 67 ~; 61 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 4 avg)
% Maximal term depth : 9 ( 2 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 16 ( 12 >; 4 *; 0 +; 0 <<)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 15 ( 15 usr; 5 con; 0-2 aty)
% Number of variables : 60 ( 0 sgn; 0 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_22,type,
n0: $i ).
tff(decl_23,type,
add: ( $i * $i ) > $i ).
tff(decl_24,type,
equalish: ( $i * $i ) > $o ).
tff(decl_25,type,
less_than: ( $i * $i ) > $o ).
tff(decl_26,type,
minimum: ( $i * $i ) > $i ).
tff(decl_27,type,
half: $i > $i ).
tff(decl_28,type,
absolute: $i > $i ).
tff(decl_29,type,
fp31: $i > $i ).
tff(decl_30,type,
a: $i ).
tff(decl_31,type,
minus: $i > $i ).
tff(decl_32,type,
f: $i > $i ).
tff(decl_33,type,
l1: $i ).
tff(decl_34,type,
fp32: $i > $i ).
tff(decl_35,type,
g: $i > $i ).
tff(decl_36,type,
l2: $i ).
tff(decl_37,type,
b: $i ).
tff(decl_38,type,
fp33: $i > $i ).
cnf(transitivity_of_less_than,axiom,
( less_than(X1,X3)
| ~ less_than(X1,X2)
| ~ less_than(X2,X3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',transitivity_of_less_than) ).
cnf(axiom_2_3,axiom,
( less_than(minimum(X1,X2),X2)
| ~ less_than(n0,X1)
| ~ less_than(n0,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_2_3) ).
cnf(axiom_3,axiom,
( less_than(add(X1,X3),X2)
| ~ less_than(X1,half(X2))
| ~ less_than(X3,half(X2)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_3) ).
cnf(c_13,negated_conjecture,
( less_than(absolute(add(g(X2),minus(l2))),X1)
| ~ less_than(n0,X1)
| ~ less_than(absolute(add(X2,minus(a))),fp32(X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c_13) ).
cnf(c_15,negated_conjecture,
( less_than(absolute(add(fp33(X1),minus(a))),X1)
| ~ less_than(n0,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c_15) ).
cnf(axiom_2_1,axiom,
( less_than(n0,minimum(X1,X2))
| ~ less_than(n0,X1)
| ~ less_than(n0,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_2_1) ).
cnf(c_12,negated_conjecture,
( less_than(n0,fp32(X1))
| ~ less_than(n0,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c_12) ).
cnf(c_16,negated_conjecture,
( ~ less_than(n0,X1)
| ~ less_than(add(absolute(add(f(fp33(X1)),minus(l1))),absolute(add(g(fp33(X1)),minus(l2)))),b) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c_16) ).
cnf(axiom_2_2,axiom,
( less_than(minimum(X1,X2),X1)
| ~ less_than(n0,X1)
| ~ less_than(n0,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_2_2) ).
cnf(c_11,negated_conjecture,
( less_than(absolute(add(f(X2),minus(l1))),X1)
| ~ less_than(n0,X1)
| ~ less_than(absolute(add(X2,minus(a))),fp31(X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c_11) ).
cnf(c_10,negated_conjecture,
( less_than(n0,fp31(X1))
| ~ less_than(n0,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c_10) ).
cnf(axiom_7,axiom,
( less_than(n0,half(X1))
| ~ less_than(n0,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_7) ).
cnf(c_14,negated_conjecture,
less_than(n0,b),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c_14) ).
cnf(c_0_13,axiom,
( less_than(X1,X3)
| ~ less_than(X1,X2)
| ~ less_than(X2,X3) ),
transitivity_of_less_than ).
cnf(c_0_14,axiom,
( less_than(minimum(X1,X2),X2)
| ~ less_than(n0,X1)
| ~ less_than(n0,X2) ),
axiom_2_3 ).
cnf(c_0_15,axiom,
( less_than(add(X1,X3),X2)
| ~ less_than(X1,half(X2))
| ~ less_than(X3,half(X2)) ),
axiom_3 ).
cnf(c_0_16,negated_conjecture,
( less_than(absolute(add(g(X2),minus(l2))),X1)
| ~ less_than(n0,X1)
| ~ less_than(absolute(add(X2,minus(a))),fp32(X1)) ),
c_13 ).
cnf(c_0_17,plain,
( less_than(X1,X2)
| ~ less_than(X1,minimum(X3,X2))
| ~ less_than(n0,X2)
| ~ less_than(n0,X3) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_18,negated_conjecture,
( less_than(absolute(add(fp33(X1),minus(a))),X1)
| ~ less_than(n0,X1) ),
c_15 ).
cnf(c_0_19,axiom,
( less_than(n0,minimum(X1,X2))
| ~ less_than(n0,X1)
| ~ less_than(n0,X2) ),
axiom_2_1 ).
cnf(c_0_20,negated_conjecture,
( less_than(add(X1,absolute(add(g(X2),minus(l2)))),X3)
| ~ less_than(absolute(add(X2,minus(a))),fp32(half(X3)))
| ~ less_than(n0,half(X3))
| ~ less_than(X1,half(X3)) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_21,negated_conjecture,
( less_than(absolute(add(fp33(minimum(X1,X2)),minus(a))),X2)
| ~ less_than(n0,X2)
| ~ less_than(n0,X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19]) ).
cnf(c_0_22,negated_conjecture,
( less_than(n0,fp32(X1))
| ~ less_than(n0,X1) ),
c_12 ).
cnf(c_0_23,negated_conjecture,
( ~ less_than(n0,X1)
| ~ less_than(add(absolute(add(f(fp33(X1)),minus(l1))),absolute(add(g(fp33(X1)),minus(l2)))),b) ),
c_16 ).
cnf(c_0_24,negated_conjecture,
( less_than(add(X1,absolute(add(g(fp33(minimum(X2,fp32(half(X3))))),minus(l2)))),X3)
| ~ less_than(n0,half(X3))
| ~ less_than(X1,half(X3))
| ~ less_than(n0,X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22]) ).
cnf(c_0_25,axiom,
( less_than(minimum(X1,X2),X1)
| ~ less_than(n0,X1)
| ~ less_than(n0,X2) ),
axiom_2_2 ).
cnf(c_0_26,negated_conjecture,
( ~ less_than(absolute(add(f(fp33(minimum(X1,fp32(half(b))))),minus(l1))),half(b))
| ~ less_than(n0,minimum(X1,fp32(half(b))))
| ~ less_than(n0,half(b))
| ~ less_than(n0,X1) ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_27,negated_conjecture,
( less_than(absolute(add(f(X2),minus(l1))),X1)
| ~ less_than(n0,X1)
| ~ less_than(absolute(add(X2,minus(a))),fp31(X1)) ),
c_11 ).
cnf(c_0_28,plain,
( less_than(X1,X2)
| ~ less_than(X1,minimum(X2,X3))
| ~ less_than(n0,X3)
| ~ less_than(n0,X2) ),
inference(spm,[status(thm)],[c_0_13,c_0_25]) ).
cnf(c_0_29,negated_conjecture,
( ~ less_than(absolute(add(fp33(minimum(X1,fp32(half(b)))),minus(a))),fp31(half(b)))
| ~ less_than(n0,minimum(X1,fp32(half(b))))
| ~ less_than(n0,half(b))
| ~ less_than(n0,X1) ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_30,negated_conjecture,
( less_than(absolute(add(fp33(minimum(X1,X2)),minus(a))),X1)
| ~ less_than(n0,X2)
| ~ less_than(n0,X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_18]),c_0_19]) ).
cnf(c_0_31,negated_conjecture,
( less_than(n0,fp31(X1))
| ~ less_than(n0,X1) ),
c_10 ).
cnf(c_0_32,negated_conjecture,
( ~ less_than(n0,minimum(fp31(half(b)),fp32(half(b))))
| ~ less_than(n0,half(b)) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_22]),c_0_31]) ).
cnf(c_0_33,negated_conjecture,
~ less_than(n0,half(b)),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_19]),c_0_31]),c_0_22]) ).
cnf(c_0_34,axiom,
( less_than(n0,half(X1))
| ~ less_than(n0,X1) ),
axiom_7 ).
cnf(c_0_35,negated_conjecture,
less_than(n0,b),
c_14 ).
cnf(c_0_36,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_35])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : ANA003-2 : TPTP v8.1.2. Released v1.0.0.
% 0.00/0.13 % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% 0.13/0.34 % Computer : n027.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 19:10:19 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.19/0.61 start to proof: theBenchmark
% 2.39/2.44 % Version : CSE_E---1.5
% 2.39/2.44 % Problem : theBenchmark.p
% 2.39/2.44 % Proof found
% 2.39/2.44 % SZS status Theorem for theBenchmark.p
% 2.39/2.44 % SZS output start Proof
% See solution above
% 2.39/2.45 % Total time : 1.825000 s
% 2.39/2.45 % SZS output end Proof
% 2.39/2.45 % Total time : 1.828000 s
%------------------------------------------------------------------------------