TSTP Solution File: BOO029-1 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : BOO029-1 : TPTP v8.1.2. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% Computer : n010.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:54 EDT 2023
% Result : Unsatisfiable 0.16s 0.56s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 11
% Syntax : Number of formulae : 27 ( 22 unt; 5 typ; 0 def)
% Number of atoms : 22 ( 21 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 ( 2 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 : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 45 ( 12 sgn; 0 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_22,type,
multiply: ( $i * $i ) > $i ).
tff(decl_23,type,
add: ( $i * $i ) > $i ).
tff(decl_24,type,
inverse: $i > $i ).
tff(decl_25,type,
b: $i ).
tff(decl_26,type,
a: $i ).
cnf(l1,axiom,
add(X1,multiply(X2,multiply(X1,X3))) = X1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l1) ).
cnf(l2,axiom,
multiply(X1,add(X2,add(X1,X3))) = X1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l2) ).
cnf(associativity_of_add,axiom,
add(add(X1,X2),X3) = add(X1,add(X2,X3)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',associativity_of_add) ).
cnf(b2,axiom,
add(multiply(X1,X2),multiply(X1,inverse(X2))) = X1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',b2) ).
cnf(commutativity_of_multiply,axiom,
multiply(X1,X2) = multiply(X2,X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',commutativity_of_multiply) ).
cnf(prove_equal_inverse,negated_conjecture,
add(b,inverse(b)) != add(a,inverse(a)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_equal_inverse) ).
cnf(c_0_6,axiom,
add(X1,multiply(X2,multiply(X1,X3))) = X1,
l1 ).
cnf(c_0_7,axiom,
multiply(X1,add(X2,add(X1,X3))) = X1,
l2 ).
cnf(c_0_8,axiom,
add(add(X1,X2),X3) = add(X1,add(X2,X3)),
associativity_of_add ).
cnf(c_0_9,plain,
add(X1,multiply(X2,X1)) = X1,
inference(spm,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_10,plain,
add(X1,add(multiply(X2,X1),X3)) = add(X1,X3),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_11,axiom,
add(multiply(X1,X2),multiply(X1,inverse(X2))) = X1,
b2 ).
cnf(c_0_12,plain,
add(X1,multiply(X2,inverse(X1))) = add(X1,X2),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_13,axiom,
multiply(X1,X2) = multiply(X2,X1),
commutativity_of_multiply ).
cnf(c_0_14,plain,
add(X1,multiply(inverse(X1),X2)) = add(X1,X2),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_15,plain,
multiply(X1,add(X2,X1)) = X1,
inference(spm,[status(thm)],[c_0_7,c_0_6]) ).
cnf(c_0_16,plain,
add(X1,add(X2,inverse(X1))) = add(X1,inverse(X1)),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_17,plain,
multiply(X1,add(X2,inverse(X2))) = X1,
inference(spm,[status(thm)],[c_0_7,c_0_16]) ).
cnf(c_0_18,plain,
multiply(add(X1,inverse(X1)),X2) = X2,
inference(spm,[status(thm)],[c_0_13,c_0_17]) ).
cnf(c_0_19,negated_conjecture,
add(b,inverse(b)) != add(a,inverse(a)),
prove_equal_inverse ).
cnf(c_0_20,plain,
add(X1,inverse(X1)) = add(X2,inverse(X2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_18]),c_0_18]) ).
cnf(c_0_21,negated_conjecture,
$false,
inference(sr,[status(thm)],[c_0_19,c_0_20]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10 % Problem : BOO029-1 : TPTP v8.1.2. Released v2.2.0.
% 0.00/0.10 % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% 0.10/0.30 % Computer : n010.cluster.edu
% 0.10/0.30 % Model : x86_64 x86_64
% 0.10/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.30 % Memory : 8042.1875MB
% 0.10/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.30 % CPULimit : 300
% 0.10/0.30 % WCLimit : 300
% 0.10/0.30 % DateTime : Sun Aug 27 08:33:49 EDT 2023
% 0.10/0.31 % CPUTime :
% 0.16/0.54 start to proof: theBenchmark
% 0.16/0.56 % Version : CSE_E---1.5
% 0.16/0.56 % Problem : theBenchmark.p
% 0.16/0.56 % Proof found
% 0.16/0.56 % SZS status Theorem for theBenchmark.p
% 0.16/0.56 % SZS output start Proof
% See solution above
% 0.16/0.56 % Total time : 0.014000 s
% 0.16/0.56 % SZS output end Proof
% 0.16/0.56 % Total time : 0.016000 s
%------------------------------------------------------------------------------