TSTP Solution File: BOO024-1 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : BOO024-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 : n009.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:53 EDT 2023
% Result : Unsatisfiable 0.48s 0.60s
% Output : CNFRefutation 0.48s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 13
% Syntax : Number of formulae : 52 ( 45 unt; 7 typ; 0 def)
% Number of atoms : 45 ( 44 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 3 ( 3 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 2 ( 1 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 8 ( 4 >; 4 *; 0 +; 0 <<)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 3 con; 0-3 aty)
% Number of variables : 71 ( 14 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,
n1: $i ).
tff(decl_26,type,
pixley: ( $i * $i * $i ) > $i ).
tff(decl_27,type,
a: $i ).
tff(decl_28,type,
b: $i ).
cnf(pixley1,axiom,
pixley(X1,X1,X2) = X2,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',pixley1) ).
cnf(pixley_defn,axiom,
pixley(X1,X2,X3) = add(multiply(X1,inverse(X2)),add(multiply(X1,X3),multiply(inverse(X2),X3))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',pixley_defn) ).
cnf(multiply_add_property,axiom,
multiply(X1,add(X2,X3)) = add(multiply(X2,X1),multiply(X3,X1)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',multiply_add_property) ).
cnf(additive_inverse,axiom,
add(X1,inverse(X1)) = n1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',additive_inverse) ).
cnf(multiply_add,axiom,
multiply(add(X1,X2),X2) = X2,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',multiply_add) ).
cnf(prove_add_multiply,negated_conjecture,
add(multiply(a,b),b) != b,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_add_multiply) ).
cnf(c_0_6,axiom,
pixley(X1,X1,X2) = X2,
pixley1 ).
cnf(c_0_7,axiom,
pixley(X1,X2,X3) = add(multiply(X1,inverse(X2)),add(multiply(X1,X3),multiply(inverse(X2),X3))),
pixley_defn ).
cnf(c_0_8,plain,
add(multiply(X1,inverse(X1)),add(multiply(X1,X2),multiply(inverse(X1),X2))) = X2,
inference(rw,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_9,axiom,
multiply(X1,add(X2,X3)) = add(multiply(X2,X1),multiply(X3,X1)),
multiply_add_property ).
cnf(c_0_10,axiom,
add(X1,inverse(X1)) = n1,
additive_inverse ).
cnf(c_0_11,axiom,
multiply(add(X1,X2),X2) = X2,
multiply_add ).
cnf(c_0_12,plain,
add(multiply(X1,inverse(X1)),multiply(X2,n1)) = X2,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_8,c_0_9]),c_0_10]) ).
cnf(c_0_13,plain,
multiply(n1,inverse(X1)) = inverse(X1),
inference(spm,[status(thm)],[c_0_11,c_0_10]) ).
cnf(c_0_14,plain,
multiply(X1,multiply(X1,n1)) = multiply(X1,n1),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_15,plain,
add(inverse(n1),multiply(X1,n1)) = X1,
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_16,plain,
add(multiply(X1,n1),multiply(X2,multiply(X1,n1))) = multiply(multiply(X1,n1),add(X1,X2)),
inference(spm,[status(thm)],[c_0_9,c_0_14]) ).
cnf(c_0_17,plain,
multiply(multiply(X1,add(X2,X3)),multiply(X3,X1)) = multiply(X3,X1),
inference(spm,[status(thm)],[c_0_11,c_0_9]) ).
cnf(c_0_18,plain,
multiply(X1,add(X2,add(X3,X1))) = add(multiply(X2,X1),X1),
inference(spm,[status(thm)],[c_0_9,c_0_11]) ).
cnf(c_0_19,plain,
add(inverse(n1),n1) = add(X1,n1),
inference(spm,[status(thm)],[c_0_15,c_0_11]) ).
cnf(c_0_20,plain,
multiply(multiply(X1,n1),add(X1,X1)) = multiply(n1,add(X1,X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_14]),c_0_9]) ).
cnf(c_0_21,plain,
multiply(add(X1,X2),add(multiply(X3,X2),X2)) = add(multiply(X3,X2),X2),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_11]),c_0_18]),c_0_18]) ).
cnf(c_0_22,plain,
add(X1,n1) = add(X2,n1),
inference(spm,[status(thm)],[c_0_19,c_0_19]) ).
cnf(c_0_23,plain,
multiply(add(X1,X1),add(X2,multiply(X1,n1))) = multiply(add(X1,X1),add(X2,n1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_20]),c_0_9]) ).
cnf(c_0_24,plain,
multiply(add(X1,n1),add(X2,n1)) = add(X2,n1),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_25,plain,
multiply(add(X1,X1),add(inverse(n1),n1)) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_15]),c_0_11]) ).
cnf(c_0_26,plain,
add(inverse(n1),n1) = n1,
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_27,plain,
multiply(X1,add(add(X2,X1),X3)) = add(X1,multiply(X3,X1)),
inference(spm,[status(thm)],[c_0_9,c_0_11]) ).
cnf(c_0_28,plain,
multiply(add(X1,X1),n1) = X1,
inference(rw,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_29,plain,
multiply(X1,add(X2,n1)) = add(X1,multiply(n1,X1)),
inference(spm,[status(thm)],[c_0_27,c_0_22]) ).
cnf(c_0_30,plain,
add(X1,n1) = n1,
inference(spm,[status(thm)],[c_0_22,c_0_26]) ).
cnf(c_0_31,plain,
add(inverse(n1),X1) = add(X1,X1),
inference(spm,[status(thm)],[c_0_15,c_0_28]) ).
cnf(c_0_32,plain,
multiply(add(X1,X2),add(X2,X2)) = add(X2,X2),
inference(spm,[status(thm)],[c_0_21,c_0_11]) ).
cnf(c_0_33,plain,
add(X1,multiply(n1,X1)) = multiply(X1,n1),
inference(rw,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_34,plain,
multiply(n1,add(X1,X1)) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_31]),c_0_9]) ).
cnf(c_0_35,plain,
multiply(X1,multiply(n1,add(X1,X1))) = multiply(n1,add(X1,X1)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_15]),c_0_9]),c_0_9]) ).
cnf(c_0_36,plain,
add(add(X1,X1),X1) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_28]) ).
cnf(c_0_37,plain,
multiply(X1,X1) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_35,c_0_34]),c_0_34]) ).
cnf(c_0_38,plain,
add(X1,X1) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_36]),c_0_37]),c_0_37]) ).
cnf(c_0_39,negated_conjecture,
add(multiply(a,b),b) != b,
prove_add_multiply ).
cnf(c_0_40,plain,
add(multiply(X1,X2),X2) = multiply(X2,add(X1,X2)),
inference(spm,[status(thm)],[c_0_9,c_0_37]) ).
cnf(c_0_41,plain,
multiply(X1,X2) = multiply(X2,X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_38]),c_0_38]) ).
cnf(c_0_42,negated_conjecture,
multiply(b,add(a,b)) != b,
inference(rw,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_43,plain,
multiply(X1,add(X2,X1)) = X1,
inference(rw,[status(thm)],[c_0_11,c_0_41]) ).
cnf(c_0_44,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_42,c_0_43])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : BOO024-1 : TPTP v8.1.2. Released v2.2.0.
% 0.07/0.13 % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% 0.12/0.34 % Computer : n009.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Sun Aug 27 08:11:05 EDT 2023
% 0.12/0.34 % CPUTime :
% 0.48/0.57 start to proof: theBenchmark
% 0.48/0.60 % Version : CSE_E---1.5
% 0.48/0.60 % Problem : theBenchmark.p
% 0.48/0.60 % Proof found
% 0.48/0.60 % SZS status Theorem for theBenchmark.p
% 0.48/0.60 % SZS output start Proof
% See solution above
% 0.48/0.60 % Total time : 0.024000 s
% 0.48/0.60 % SZS output end Proof
% 0.48/0.60 % Total time : 0.027000 s
%------------------------------------------------------------------------------