TSTP Solution File: FLD010-3 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : FLD010-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 : n015.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:15 EDT 2023
% Result : Unsatisfiable 0.20s 0.60s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 15
% Syntax : Number of formulae : 22 ( 8 unt; 10 typ; 0 def)
% Number of atoms : 18 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 14 ( 8 ~; 6 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 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 : 6 ( 6 usr; 2 con; 0-2 aty)
% Number of variables : 8 ( 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 ).
cnf(existence_of_inverse_multiplication,axiom,
( product(multiplicative_inverse(X1),X1,multiplicative_identity)
| sum(additive_identity,X1,additive_identity)
| ~ defined(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/FLD002-0.ax',existence_of_inverse_multiplication) ).
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(not_sum_1,negated_conjecture,
~ sum(additive_identity,multiplicative_identity,additive_identity),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',not_sum_1) ).
cnf(commutativity_multiplication,axiom,
( product(X1,X2,X3)
| ~ product(X2,X1,X3) ),
file('/export/starexec/sandbox2/benchmark/Axioms/FLD002-0.ax',commutativity_multiplication) ).
cnf(not_product_2,negated_conjecture,
~ product(multiplicative_identity,multiplicative_inverse(multiplicative_identity),multiplicative_identity),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',not_product_2) ).
cnf(c_0_5,axiom,
( product(multiplicative_inverse(X1),X1,multiplicative_identity)
| sum(additive_identity,X1,additive_identity)
| ~ defined(X1) ),
existence_of_inverse_multiplication ).
cnf(c_0_6,axiom,
defined(multiplicative_identity),
well_definedness_of_multiplicative_identity ).
cnf(c_0_7,negated_conjecture,
~ sum(additive_identity,multiplicative_identity,additive_identity),
not_sum_1 ).
cnf(c_0_8,axiom,
( product(X1,X2,X3)
| ~ product(X2,X1,X3) ),
commutativity_multiplication ).
cnf(c_0_9,plain,
product(multiplicative_inverse(multiplicative_identity),multiplicative_identity,multiplicative_identity),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_5,c_0_6]),c_0_7]) ).
cnf(c_0_10,negated_conjecture,
~ product(multiplicative_identity,multiplicative_inverse(multiplicative_identity),multiplicative_identity),
not_product_2 ).
cnf(c_0_11,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_9]),c_0_10]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : FLD010-3 : TPTP v8.1.2. Bugfixed v2.1.0.
% 0.00/0.14 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% 0.14/0.35 % Computer : n015.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Mon Aug 28 00:56:09 EDT 2023
% 0.14/0.36 % 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.006000 s
% 0.20/0.60 % SZS output end Proof
% 0.20/0.60 % Total time : 0.009000 s
%------------------------------------------------------------------------------