TSTP Solution File: FLD025-2 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : FLD025-2 : 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 : n032.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.15s 0.49s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 26
% Syntax : Number of formulae : 50 ( 21 unt; 15 typ; 0 def)
% Number of atoms : 57 ( 0 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 46 ( 24 ~; 22 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 11 ( 7 >; 4 *; 0 +; 0 <<)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 8 con; 0-2 aty)
% Number of variables : 28 ( 0 sgn; 0 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_22,type,
add: ( $i * $i ) > $i ).
tff(decl_23,type,
equalish: ( $i * $i ) > $o ).
tff(decl_24,type,
defined: $i > $o ).
tff(decl_25,type,
additive_identity: $i ).
tff(decl_26,type,
additive_inverse: $i > $i ).
tff(decl_27,type,
multiply: ( $i * $i ) > $i ).
tff(decl_28,type,
multiplicative_identity: $i ).
tff(decl_29,type,
multiplicative_inverse: $i > $i ).
tff(decl_30,type,
less_or_equal: ( $i * $i ) > $o ).
tff(decl_31,type,
a: $i ).
tff(decl_32,type,
b: $i ).
tff(decl_33,type,
c: $i ).
tff(decl_34,type,
d: $i ).
tff(decl_35,type,
u: $i ).
tff(decl_36,type,
v: $i ).
cnf(transitivity_of_equality,axiom,
( equalish(X1,X2)
| ~ equalish(X1,X3)
| ~ equalish(X3,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/FLD001-0.ax',transitivity_of_equality) ).
cnf(multiply_equals_v_10,negated_conjecture,
equalish(multiply(d,b),v),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',multiply_equals_v_10) ).
cnf(compatibility_of_equality_and_multiplication,axiom,
( equalish(multiply(X1,X2),multiply(X3,X2))
| ~ defined(X2)
| ~ equalish(X1,X3) ),
file('/export/starexec/sandbox/benchmark/Axioms/FLD001-0.ax',compatibility_of_equality_and_multiplication) ).
cnf(c_equals_d_8,negated_conjecture,
equalish(c,d),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c_equals_d_8) ).
cnf(b_is_defined,hypothesis,
defined(b),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',b_is_defined) ).
cnf(commutativity_multiplication,axiom,
( equalish(multiply(X1,X2),multiply(X2,X1))
| ~ defined(X1)
| ~ defined(X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/FLD001-0.ax',commutativity_multiplication) ).
cnf(symmetry_of_equality,axiom,
( equalish(X1,X2)
| ~ equalish(X2,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/FLD001-0.ax',symmetry_of_equality) ).
cnf(c_is_defined,hypothesis,
defined(c),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c_is_defined) ).
cnf(a_equals_b_7,negated_conjecture,
equalish(a,b),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',a_equals_b_7) ).
cnf(multiply_equals_u_9,negated_conjecture,
equalish(multiply(a,c),u),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',multiply_equals_u_9) ).
cnf(v_not_equal_to_u_11,negated_conjecture,
~ equalish(v,u),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',v_not_equal_to_u_11) ).
cnf(c_0_11,axiom,
( equalish(X1,X2)
| ~ equalish(X1,X3)
| ~ equalish(X3,X2) ),
transitivity_of_equality ).
cnf(c_0_12,negated_conjecture,
equalish(multiply(d,b),v),
multiply_equals_v_10 ).
cnf(c_0_13,axiom,
( equalish(multiply(X1,X2),multiply(X3,X2))
| ~ defined(X2)
| ~ equalish(X1,X3) ),
compatibility_of_equality_and_multiplication ).
cnf(c_0_14,negated_conjecture,
equalish(c,d),
c_equals_d_8 ).
cnf(c_0_15,negated_conjecture,
( equalish(X1,v)
| ~ equalish(X1,multiply(d,b)) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_16,negated_conjecture,
( equalish(multiply(c,X1),multiply(d,X1))
| ~ defined(X1) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_17,hypothesis,
defined(b),
b_is_defined ).
cnf(c_0_18,axiom,
( equalish(multiply(X1,X2),multiply(X2,X1))
| ~ defined(X1)
| ~ defined(X2) ),
commutativity_multiplication ).
cnf(c_0_19,axiom,
( equalish(X1,X2)
| ~ equalish(X2,X1) ),
symmetry_of_equality ).
cnf(c_0_20,negated_conjecture,
equalish(multiply(c,b),v),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17])]) ).
cnf(c_0_21,plain,
( equalish(X1,multiply(X2,X3))
| ~ defined(X2)
| ~ defined(X3)
| ~ equalish(X1,multiply(X3,X2)) ),
inference(spm,[status(thm)],[c_0_11,c_0_18]) ).
cnf(c_0_22,negated_conjecture,
equalish(v,multiply(c,b)),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_23,hypothesis,
defined(c),
c_is_defined ).
cnf(c_0_24,negated_conjecture,
equalish(v,multiply(b,c)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_17]),c_0_23])]) ).
cnf(c_0_25,negated_conjecture,
equalish(multiply(b,c),v),
inference(spm,[status(thm)],[c_0_19,c_0_24]) ).
cnf(c_0_26,negated_conjecture,
equalish(a,b),
a_equals_b_7 ).
cnf(c_0_27,negated_conjecture,
( equalish(X1,v)
| ~ equalish(X1,multiply(b,c)) ),
inference(spm,[status(thm)],[c_0_11,c_0_25]) ).
cnf(c_0_28,negated_conjecture,
( equalish(multiply(a,X1),multiply(b,X1))
| ~ defined(X1) ),
inference(spm,[status(thm)],[c_0_13,c_0_26]) ).
cnf(c_0_29,negated_conjecture,
equalish(multiply(a,c),u),
multiply_equals_u_9 ).
cnf(c_0_30,negated_conjecture,
equalish(multiply(a,c),v),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_23])]) ).
cnf(c_0_31,negated_conjecture,
( equalish(X1,u)
| ~ equalish(X1,multiply(a,c)) ),
inference(spm,[status(thm)],[c_0_11,c_0_29]) ).
cnf(c_0_32,negated_conjecture,
equalish(v,multiply(a,c)),
inference(spm,[status(thm)],[c_0_19,c_0_30]) ).
cnf(c_0_33,negated_conjecture,
~ equalish(v,u),
v_not_equal_to_u_11 ).
cnf(c_0_34,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_33]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10 % Problem : FLD025-2 : TPTP v8.1.2. Bugfixed v2.1.0.
% 0.00/0.10 % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% 0.10/0.29 % Computer : n032.cluster.edu
% 0.10/0.29 % Model : x86_64 x86_64
% 0.10/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.29 % Memory : 8042.1875MB
% 0.10/0.29 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.29 % CPULimit : 300
% 0.10/0.29 % WCLimit : 300
% 0.10/0.29 % DateTime : Mon Aug 28 00:46:15 EDT 2023
% 0.10/0.30 % CPUTime :
% 0.15/0.48 start to proof: theBenchmark
% 0.15/0.49 % Version : CSE_E---1.5
% 0.15/0.49 % Problem : theBenchmark.p
% 0.15/0.49 % Proof found
% 0.15/0.49 % SZS status Theorem for theBenchmark.p
% 0.15/0.49 % SZS output start Proof
% See solution above
% 0.15/0.49 % Total time : 0.011000 s
% 0.15/0.50 % SZS output end Proof
% 0.15/0.50 % Total time : 0.014000 s
%------------------------------------------------------------------------------