TSTP Solution File: FLD055-3 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : FLD055-3 : TPTP v8.1.2. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% Computer : n002.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:40 EDT 2023
% Result : Unsatisfiable 0.20s 0.59s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 22
% Syntax : Number of formulae : 37 ( 12 unt; 13 typ; 0 def)
% Number of atoms : 47 ( 0 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 46 ( 23 ~; 23 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 3 avg)
% Maximal term depth : 1 ( 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 : 9 ( 9 usr; 5 con; 0-2 aty)
% Number of variables : 27 ( 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 ).
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/sandbox2/benchmark/Axioms/FLD002-0.ax',compatibility_of_order_relation_and_addition) ).
cnf(sum_5,negated_conjecture,
sum(additive_identity,b,c),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sum_5) ).
cnf(totality_of_order_relation,axiom,
( less_or_equal(X1,X2)
| less_or_equal(X2,X1)
| ~ defined(X1)
| ~ defined(X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/FLD002-0.ax',totality_of_order_relation) ).
cnf(well_definedness_of_additive_identity,axiom,
defined(additive_identity),
file('/export/starexec/sandbox2/benchmark/Axioms/FLD002-0.ax',well_definedness_of_additive_identity) ).
cnf(existence_of_identity_addition,axiom,
( sum(additive_identity,X1,X1)
| ~ defined(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/FLD002-0.ax',existence_of_identity_addition) ).
cnf(b_is_defined,hypothesis,
defined(b),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',b_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/sandbox2/benchmark/Axioms/FLD002-0.ax',transitivity_of_order_relation) ).
cnf(less_or_equal_4,negated_conjecture,
less_or_equal(a,b),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',less_or_equal_4) ).
cnf(not_less_or_equal_6,negated_conjecture,
~ less_or_equal(a,c),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',not_less_or_equal_6) ).
cnf(c_0_9,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_10,negated_conjecture,
sum(additive_identity,b,c),
sum_5 ).
cnf(c_0_11,axiom,
( less_or_equal(X1,X2)
| less_or_equal(X2,X1)
| ~ defined(X1)
| ~ defined(X2) ),
totality_of_order_relation ).
cnf(c_0_12,negated_conjecture,
( less_or_equal(X1,c)
| ~ less_or_equal(X2,additive_identity)
| ~ sum(X2,b,X1) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_13,plain,
( less_or_equal(X1,X1)
| ~ defined(X1) ),
inference(ef,[status(thm)],[c_0_11]) ).
cnf(c_0_14,axiom,
defined(additive_identity),
well_definedness_of_additive_identity ).
cnf(c_0_15,negated_conjecture,
( less_or_equal(X1,c)
| ~ sum(additive_identity,b,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14])]) ).
cnf(c_0_16,axiom,
( sum(additive_identity,X1,X1)
| ~ defined(X1) ),
existence_of_identity_addition ).
cnf(c_0_17,hypothesis,
defined(b),
b_is_defined ).
cnf(c_0_18,axiom,
( less_or_equal(X1,X2)
| ~ less_or_equal(X1,X3)
| ~ less_or_equal(X3,X2) ),
transitivity_of_order_relation ).
cnf(c_0_19,negated_conjecture,
less_or_equal(b,c),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17])]) ).
cnf(c_0_20,negated_conjecture,
( less_or_equal(X1,c)
| ~ less_or_equal(X1,b) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_21,negated_conjecture,
less_or_equal(a,b),
less_or_equal_4 ).
cnf(c_0_22,negated_conjecture,
~ less_or_equal(a,c),
not_less_or_equal_6 ).
cnf(c_0_23,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : FLD055-3 : TPTP v8.1.2. Bugfixed v2.1.0.
% 0.07/0.13 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% 0.13/0.34 % Computer : n002.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 : Sun Aug 27 23:26:04 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.20/0.57 start to proof: theBenchmark
% 0.20/0.59 % Version : CSE_E---1.5
% 0.20/0.59 % Problem : theBenchmark.p
% 0.20/0.59 % Proof found
% 0.20/0.59 % SZS status Theorem for theBenchmark.p
% 0.20/0.59 % SZS output start Proof
% See solution above
% 0.20/0.59 % Total time : 0.007000 s
% 0.20/0.59 % SZS output end Proof
% 0.20/0.59 % Total time : 0.009000 s
%------------------------------------------------------------------------------