TSTP Solution File: FLD025-4 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : FLD025-4 : 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 : n004.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:23 EDT 2023
% Result : Unsatisfiable 0.19s 0.58s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 24
% Syntax : Number of formulae : 41 ( 16 unt; 15 typ; 0 def)
% Number of atoms : 44 ( 0 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 38 ( 20 ~; 18 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 2 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 : 11 ( 11 usr; 7 con; 0-2 aty)
% Number of variables : 30 ( 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 ).
cnf(associativity_multiplication_1,axiom,
( product(X1,X2,X3)
| ~ product(X1,X4,X5)
| ~ product(X4,X6,X2)
| ~ product(X5,X6,X3) ),
file('/export/starexec/sandbox2/benchmark/Axioms/FLD002-0.ax',associativity_multiplication_1) ).
cnf(existence_of_identity_multiplication,axiom,
( product(multiplicative_identity,X1,X1)
| ~ defined(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/FLD002-0.ax',existence_of_identity_multiplication) ).
cnf(commutativity_multiplication,axiom,
( product(X1,X2,X3)
| ~ product(X2,X1,X3) ),
file('/export/starexec/sandbox2/benchmark/Axioms/FLD002-0.ax',commutativity_multiplication) ).
cnf(product_8,negated_conjecture,
product(a,c,u),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',product_8) ).
cnf(well_definedness_of_multiplicative_identity,axiom,
defined(multiplicative_identity),
file('/export/starexec/sandbox2/benchmark/Axioms/FLD002-0.ax',well_definedness_of_multiplicative_identity) ).
cnf(product_7,negated_conjecture,
product(multiplicative_identity,c,d),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',product_7) ).
cnf(c_is_defined,hypothesis,
defined(c),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c_is_defined) ).
cnf(product_6,negated_conjecture,
product(multiplicative_identity,a,b),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',product_6) ).
cnf(not_product_9,negated_conjecture,
~ product(d,b,u),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',not_product_9) ).
cnf(c_0_9,axiom,
( product(X1,X2,X3)
| ~ product(X1,X4,X5)
| ~ product(X4,X6,X2)
| ~ product(X5,X6,X3) ),
associativity_multiplication_1 ).
cnf(c_0_10,axiom,
( product(multiplicative_identity,X1,X1)
| ~ defined(X1) ),
existence_of_identity_multiplication ).
cnf(c_0_11,axiom,
( product(X1,X2,X3)
| ~ product(X2,X1,X3) ),
commutativity_multiplication ).
cnf(c_0_12,negated_conjecture,
product(a,c,u),
product_8 ).
cnf(c_0_13,plain,
( product(X1,X2,X3)
| ~ product(X1,X4,multiplicative_identity)
| ~ product(X4,X3,X2)
| ~ defined(X3) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_14,axiom,
defined(multiplicative_identity),
well_definedness_of_multiplicative_identity ).
cnf(c_0_15,negated_conjecture,
product(c,a,u),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_16,plain,
( product(multiplicative_identity,X1,X2)
| ~ product(multiplicative_identity,X2,X1)
| ~ defined(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_10]),c_0_14])]) ).
cnf(c_0_17,negated_conjecture,
product(multiplicative_identity,c,d),
product_7 ).
cnf(c_0_18,hypothesis,
defined(c),
c_is_defined ).
cnf(c_0_19,negated_conjecture,
( product(X1,X2,u)
| ~ product(X3,a,X2)
| ~ product(X1,X3,c) ),
inference(spm,[status(thm)],[c_0_9,c_0_15]) ).
cnf(c_0_20,negated_conjecture,
product(multiplicative_identity,a,b),
product_6 ).
cnf(c_0_21,negated_conjecture,
product(multiplicative_identity,d,c),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18])]) ).
cnf(c_0_22,negated_conjecture,
( product(X1,b,u)
| ~ product(X1,multiplicative_identity,c) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_23,negated_conjecture,
product(d,multiplicative_identity,c),
inference(spm,[status(thm)],[c_0_11,c_0_21]) ).
cnf(c_0_24,negated_conjecture,
~ product(d,b,u),
not_product_9 ).
cnf(c_0_25,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_24]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : FLD025-4 : TPTP v8.1.2. Bugfixed v2.1.0.
% 0.00/0.13 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% 0.13/0.34 % Computer : n004.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:21:22 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.19/0.56 start to proof: theBenchmark
% 0.19/0.58 % Version : CSE_E---1.5
% 0.19/0.58 % Problem : theBenchmark.p
% 0.19/0.58 % Proof found
% 0.19/0.58 % SZS status Theorem for theBenchmark.p
% 0.19/0.58 % SZS output start Proof
% See solution above
% 0.19/0.59 % Total time : 0.012000 s
% 0.19/0.59 % SZS output end Proof
% 0.19/0.59 % Total time : 0.015000 s
%------------------------------------------------------------------------------