TSTP Solution File: FLD061-4 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : FLD061-4 : TPTP v8.1.2. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% Computer : n006.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 22:27:44 EDT 2023
% Result : Unsatisfiable 0.20s 0.60s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 27
% Syntax : Number of formulae : 49 ( 19 unt; 16 typ; 0 def)
% Number of atoms : 61 ( 0 equ)
% Maximal formula atoms : 5 ( 1 avg)
% Number of connectives : 58 ( 30 ~; 28 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 2 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 : 5 ( 4 usr; 1 prp; 0-3 aty)
% Number of functors : 12 ( 12 usr; 8 con; 0-2 aty)
% Number of variables : 37 ( 0 sgn; 0 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_22,type,
sum: ( $i * $i * $i ) > $o ).
tff(decl_23,type,
additive_identity: $i ).
tff(decl_24,type,
defined: $i > $o ).
tff(decl_25,type,
additive_inverse: $i > $i ).
tff(decl_26,type,
product: ( $i * $i * $i ) > $o ).
tff(decl_27,type,
multiplicative_identity: $i ).
tff(decl_28,type,
multiplicative_inverse: $i > $i ).
tff(decl_29,type,
add: ( $i * $i ) > $i ).
tff(decl_30,type,
multiply: ( $i * $i ) > $i ).
tff(decl_31,type,
less_or_equal: ( $i * $i ) > $o ).
tff(decl_32,type,
a: $i ).
tff(decl_33,type,
b: $i ).
tff(decl_34,type,
c: $i ).
tff(decl_35,type,
d: $i ).
tff(decl_36,type,
u: $i ).
tff(decl_37,type,
v: $i ).
cnf(commutativity_addition,axiom,
( sum(X1,X2,X3)
| ~ sum(X2,X1,X3) ),
file('/export/starexec/sandbox/benchmark/Axioms/FLD002-0.ax',commutativity_addition) ).
cnf(sum_10,negated_conjecture,
sum(d,b,v),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sum_10) ).
cnf(compatibility_of_order_relation_and_addition,axiom,
( less_or_equal(X1,X2)
| ~ less_or_equal(X3,X4)
| ~ sum(X3,X5,X1)
| ~ sum(X4,X5,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/FLD002-0.ax',compatibility_of_order_relation_and_addition) ).
cnf(less_or_equal_7,negated_conjecture,
less_or_equal(a,b),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',less_or_equal_7) ).
cnf(totality_of_addition,axiom,
( sum(X1,X2,add(X1,X2))
| ~ defined(X1)
| ~ defined(X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/FLD002-0.ax',totality_of_addition) ).
cnf(sum_9,negated_conjecture,
sum(a,c,u),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sum_9) ).
cnf(a_is_defined,hypothesis,
defined(a),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',a_is_defined) ).
cnf(d_is_defined,hypothesis,
defined(d),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d_is_defined) ).
cnf(transitivity_of_order_relation,axiom,
( less_or_equal(X1,X2)
| ~ less_or_equal(X1,X3)
| ~ less_or_equal(X3,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/FLD002-0.ax',transitivity_of_order_relation) ).
cnf(less_or_equal_8,negated_conjecture,
less_or_equal(c,d),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',less_or_equal_8) ).
cnf(not_less_or_equal_11,negated_conjecture,
~ less_or_equal(u,v),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',not_less_or_equal_11) ).
cnf(c_0_11,axiom,
( sum(X1,X2,X3)
| ~ sum(X2,X1,X3) ),
commutativity_addition ).
cnf(c_0_12,negated_conjecture,
sum(d,b,v),
sum_10 ).
cnf(c_0_13,axiom,
( less_or_equal(X1,X2)
| ~ less_or_equal(X3,X4)
| ~ sum(X3,X5,X1)
| ~ sum(X4,X5,X2) ),
compatibility_of_order_relation_and_addition ).
cnf(c_0_14,negated_conjecture,
sum(b,d,v),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_15,negated_conjecture,
( less_or_equal(X1,v)
| ~ less_or_equal(X2,b)
| ~ sum(X2,d,X1) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_16,negated_conjecture,
less_or_equal(a,b),
less_or_equal_7 ).
cnf(c_0_17,axiom,
( sum(X1,X2,add(X1,X2))
| ~ defined(X1)
| ~ defined(X2) ),
totality_of_addition ).
cnf(c_0_18,negated_conjecture,
sum(a,c,u),
sum_9 ).
cnf(c_0_19,negated_conjecture,
( less_or_equal(X1,v)
| ~ sum(a,d,X1) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_20,plain,
( sum(X1,X2,add(X2,X1))
| ~ defined(X1)
| ~ defined(X2) ),
inference(spm,[status(thm)],[c_0_11,c_0_17]) ).
cnf(c_0_21,hypothesis,
defined(a),
a_is_defined ).
cnf(c_0_22,hypothesis,
defined(d),
d_is_defined ).
cnf(c_0_23,plain,
( less_or_equal(X1,add(X2,X3))
| ~ less_or_equal(X4,X2)
| ~ defined(X3)
| ~ defined(X2)
| ~ sum(X4,X3,X1) ),
inference(spm,[status(thm)],[c_0_13,c_0_17]) ).
cnf(c_0_24,negated_conjecture,
sum(c,a,u),
inference(spm,[status(thm)],[c_0_11,c_0_18]) ).
cnf(c_0_25,axiom,
( less_or_equal(X1,X2)
| ~ less_or_equal(X1,X3)
| ~ less_or_equal(X3,X2) ),
transitivity_of_order_relation ).
cnf(c_0_26,negated_conjecture,
less_or_equal(add(d,a),v),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21]),c_0_22])]) ).
cnf(c_0_27,negated_conjecture,
( less_or_equal(u,add(X1,a))
| ~ less_or_equal(c,X1)
| ~ defined(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_21])]) ).
cnf(c_0_28,negated_conjecture,
less_or_equal(c,d),
less_or_equal_8 ).
cnf(c_0_29,negated_conjecture,
( less_or_equal(X1,v)
| ~ less_or_equal(X1,add(d,a)) ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_30,negated_conjecture,
less_or_equal(u,add(d,a)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_22])]) ).
cnf(c_0_31,negated_conjecture,
~ less_or_equal(u,v),
not_less_or_equal_11 ).
cnf(c_0_32,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_31]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : FLD061-4 : TPTP v8.1.2. Bugfixed v2.1.0.
% 0.00/0.13 % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% 0.13/0.35 % Computer : n006.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % 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 : Sun Aug 27 23:13:36 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.20/0.58 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.015000 s
% 0.20/0.60 % SZS output end Proof
% 0.20/0.60 % Total time : 0.018000 s
%------------------------------------------------------------------------------