TSTP Solution File: BOO017-2 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : BOO017-2 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% Computer : n014.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 18:05:52 EDT 2023
% Result : Unsatisfiable 0.19s 0.56s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 19
% Syntax : Number of formulae : 39 ( 31 unt; 8 typ; 0 def)
% Number of atoms : 31 ( 30 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 2 ( 2 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 2 ( 1 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 5 ( 3 >; 2 *; 0 +; 0 <<)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 5 con; 0-2 aty)
% Number of variables : 40 ( 3 sgn; 0 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_22,type,
add: ( $i * $i ) > $i ).
tff(decl_23,type,
multiply: ( $i * $i ) > $i ).
tff(decl_24,type,
inverse: $i > $i ).
tff(decl_25,type,
multiplicative_identity: $i ).
tff(decl_26,type,
additive_identity: $i ).
tff(decl_27,type,
x: $i ).
tff(decl_28,type,
y: $i ).
tff(decl_29,type,
z: $i ).
cnf(distributivity2,axiom,
add(X1,multiply(X2,X3)) = multiply(add(X1,X2),add(X1,X3)),
file('/export/starexec/sandbox/benchmark/Axioms/BOO003-0.ax',distributivity2) ).
cnf(additive_inverse1,axiom,
add(X1,inverse(X1)) = multiplicative_identity,
file('/export/starexec/sandbox/benchmark/Axioms/BOO003-0.ax',additive_inverse1) ).
cnf(multiplicative_id1,axiom,
multiply(X1,multiplicative_identity) = X1,
file('/export/starexec/sandbox/benchmark/Axioms/BOO003-0.ax',multiplicative_id1) ).
cnf(additive_id1,axiom,
add(X1,additive_identity) = X1,
file('/export/starexec/sandbox/benchmark/Axioms/BOO003-0.ax',additive_id1) ).
cnf(commutativity_of_multiply,axiom,
multiply(X1,X2) = multiply(X2,X1),
file('/export/starexec/sandbox/benchmark/Axioms/BOO003-0.ax',commutativity_of_multiply) ).
cnf(multiplicative_id2,axiom,
multiply(multiplicative_identity,X1) = X1,
file('/export/starexec/sandbox/benchmark/Axioms/BOO003-0.ax',multiplicative_id2) ).
cnf(commutativity_of_add,axiom,
add(X1,X2) = add(X2,X1),
file('/export/starexec/sandbox/benchmark/Axioms/BOO003-0.ax',commutativity_of_add) ).
cnf(x_times_y,hypothesis,
add(x,y) = z,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',x_times_y) ).
cnf(distributivity4,axiom,
multiply(X1,add(X2,X3)) = add(multiply(X1,X2),multiply(X1,X3)),
file('/export/starexec/sandbox/benchmark/Axioms/BOO003-0.ax',distributivity4) ).
cnf(additive_id2,axiom,
add(additive_identity,X1) = X1,
file('/export/starexec/sandbox/benchmark/Axioms/BOO003-0.ax',additive_id2) ).
cnf(prove_sum,negated_conjecture,
multiply(x,z) != x,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_sum) ).
cnf(c_0_11,axiom,
add(X1,multiply(X2,X3)) = multiply(add(X1,X2),add(X1,X3)),
distributivity2 ).
cnf(c_0_12,axiom,
add(X1,inverse(X1)) = multiplicative_identity,
additive_inverse1 ).
cnf(c_0_13,axiom,
multiply(X1,multiplicative_identity) = X1,
multiplicative_id1 ).
cnf(c_0_14,axiom,
add(X1,additive_identity) = X1,
additive_id1 ).
cnf(c_0_15,axiom,
multiply(X1,X2) = multiply(X2,X1),
commutativity_of_multiply ).
cnf(c_0_16,plain,
add(X1,multiply(X2,inverse(X1))) = add(X1,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_13]) ).
cnf(c_0_17,axiom,
multiply(multiplicative_identity,X1) = X1,
multiplicative_id2 ).
cnf(c_0_18,plain,
multiply(X1,add(X1,X2)) = add(X1,multiply(X2,additive_identity)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_14]),c_0_15]) ).
cnf(c_0_19,axiom,
add(X1,X2) = add(X2,X1),
commutativity_of_add ).
cnf(c_0_20,hypothesis,
add(x,y) = z,
x_times_y ).
cnf(c_0_21,axiom,
multiply(X1,add(X2,X3)) = add(multiply(X1,X2),multiply(X1,X3)),
distributivity4 ).
cnf(c_0_22,plain,
add(X1,multiplicative_identity) = multiplicative_identity,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_12]) ).
cnf(c_0_23,plain,
multiply(X1,add(X2,X1)) = add(X1,multiply(X2,additive_identity)),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_24,hypothesis,
add(y,x) = z,
inference(rw,[status(thm)],[c_0_20,c_0_19]) ).
cnf(c_0_25,axiom,
add(additive_identity,X1) = X1,
additive_id2 ).
cnf(c_0_26,plain,
add(X1,multiply(X1,X2)) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_13]),c_0_22]),c_0_13]),c_0_19]) ).
cnf(c_0_27,hypothesis,
add(x,multiply(additive_identity,y)) = multiply(x,z),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_15]) ).
cnf(c_0_28,plain,
multiply(additive_identity,X1) = additive_identity,
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_29,negated_conjecture,
multiply(x,z) != x,
prove_sum ).
cnf(c_0_30,hypothesis,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_27,c_0_28]),c_0_14]),c_0_29]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : BOO017-2 : TPTP v8.1.2. Released v1.0.0.
% 0.12/0.12 % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% 0.12/0.33 % Computer : n014.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Sun Aug 27 08:14:46 EDT 2023
% 0.12/0.33 % CPUTime :
% 0.19/0.54 start to proof: theBenchmark
% 0.19/0.56 % Version : CSE_E---1.5
% 0.19/0.56 % Problem : theBenchmark.p
% 0.19/0.56 % Proof found
% 0.19/0.56 % SZS status Theorem for theBenchmark.p
% 0.19/0.56 % SZS output start Proof
% See solution above
% 0.19/0.56 % Total time : 0.008000 s
% 0.19/0.56 % SZS output end Proof
% 0.19/0.56 % Total time : 0.011000 s
%------------------------------------------------------------------------------