TSTP Solution File: BOO034-1 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : BOO034-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 : n016.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:55 EDT 2023
% Result : Unsatisfiable 0.19s 0.63s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 15
% Syntax : Number of formulae : 35 ( 26 unt; 9 typ; 0 def)
% Number of atoms : 26 ( 25 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 5 ( 5 ~; 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 : 4 ( 2 >; 2 *; 0 +; 0 <<)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 7 con; 0-3 aty)
% Number of variables : 54 ( 4 sgn; 0 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_22,type,
multiply: ( $i * $i * $i ) > $i ).
tff(decl_23,type,
inverse: $i > $i ).
tff(decl_24,type,
a: $i ).
tff(decl_25,type,
b: $i ).
tff(decl_26,type,
c: $i ).
tff(decl_27,type,
d: $i ).
tff(decl_28,type,
e: $i ).
tff(decl_29,type,
f: $i ).
tff(decl_30,type,
g: $i ).
cnf(associativity,axiom,
multiply(multiply(X1,X2,X3),X4,multiply(X1,X2,X5)) = multiply(X1,X2,multiply(X3,X4,X5)),
file('/export/starexec/sandbox/benchmark/Axioms/BOO001-0.ax',associativity) ).
cnf(ternary_multiply_1,axiom,
multiply(X1,X2,X2) = X2,
file('/export/starexec/sandbox/benchmark/Axioms/BOO001-0.ax',ternary_multiply_1) ).
cnf(right_inverse,axiom,
multiply(X1,X2,inverse(X2)) = X1,
file('/export/starexec/sandbox/benchmark/Axioms/BOO001-0.ax',right_inverse) ).
cnf(ternary_multiply_2,axiom,
multiply(X1,X1,X2) = X1,
file('/export/starexec/sandbox/benchmark/Axioms/BOO001-0.ax',ternary_multiply_2) ).
cnf(left_inverse,axiom,
multiply(inverse(X1),X1,X2) = X2,
file('/export/starexec/sandbox/benchmark/Axioms/BOO001-0.ax',left_inverse) ).
cnf(prove_single_axiom,negated_conjecture,
multiply(multiply(a,inverse(a),b),inverse(multiply(multiply(c,d,e),f,multiply(c,d,g))),multiply(d,multiply(g,f,e),c)) != b,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_single_axiom) ).
cnf(c_0_6,axiom,
multiply(multiply(X1,X2,X3),X4,multiply(X1,X2,X5)) = multiply(X1,X2,multiply(X3,X4,X5)),
associativity ).
cnf(c_0_7,axiom,
multiply(X1,X2,X2) = X2,
ternary_multiply_1 ).
cnf(c_0_8,plain,
multiply(multiply(X1,X2,X3),X4,X2) = multiply(X1,X2,multiply(X3,X4,X2)),
inference(spm,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_9,axiom,
multiply(X1,X2,inverse(X2)) = X1,
right_inverse ).
cnf(c_0_10,plain,
multiply(X1,X2,multiply(inverse(X2),X3,X2)) = multiply(X1,X3,X2),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_11,axiom,
multiply(X1,X1,X2) = X1,
ternary_multiply_2 ).
cnf(c_0_12,axiom,
multiply(inverse(X1),X1,X2) = X2,
left_inverse ).
cnf(c_0_13,plain,
multiply(X1,inverse(X2),X2) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_9]) ).
cnf(c_0_14,negated_conjecture,
multiply(multiply(a,inverse(a),b),inverse(multiply(multiply(c,d,e),f,multiply(c,d,g))),multiply(d,multiply(g,f,e),c)) != b,
prove_single_axiom ).
cnf(c_0_15,plain,
inverse(inverse(X1)) = X1,
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_16,plain,
multiply(X1,X2,multiply(X3,X1,X4)) = multiply(X3,X1,multiply(X1,X2,X4)),
inference(spm,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_17,negated_conjecture,
multiply(multiply(a,inverse(a),b),inverse(multiply(c,d,multiply(e,f,g))),multiply(d,multiply(g,f,e),c)) != b,
inference(rw,[status(thm)],[c_0_14,c_0_6]) ).
cnf(c_0_18,plain,
multiply(X1,inverse(X1),X2) = X2,
inference(spm,[status(thm)],[c_0_12,c_0_15]) ).
cnf(c_0_19,plain,
multiply(inverse(X1),X2,X1) = X2,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_16]),c_0_7]),c_0_11]) ).
cnf(c_0_20,negated_conjecture,
multiply(b,inverse(multiply(c,d,multiply(e,f,g))),multiply(d,multiply(g,f,e),c)) != b,
inference(rw,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_21,plain,
multiply(X1,X2,X3) = multiply(X1,X3,X2),
inference(rw,[status(thm)],[c_0_10,c_0_19]) ).
cnf(c_0_22,plain,
multiply(multiply(X1,X2,X3),X4,X1) = multiply(X1,X2,multiply(X3,X4,inverse(X2))),
inference(spm,[status(thm)],[c_0_6,c_0_9]) ).
cnf(c_0_23,negated_conjecture,
multiply(b,multiply(d,c,multiply(g,e,f)),inverse(multiply(c,d,multiply(e,f,g)))) != b,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_20,c_0_21]),c_0_21]),c_0_21]) ).
cnf(c_0_24,plain,
multiply(X1,X2,X3) = multiply(X3,X1,X2),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_19]),c_0_15]),c_0_7]) ).
cnf(c_0_25,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_23,c_0_24]),c_0_24]),c_0_21]),c_0_24]),c_0_21]),c_0_21]),c_0_9])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : BOO034-1 : TPTP v8.1.2. Released v2.2.0.
% 0.00/0.13 % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% 0.13/0.34 % Computer : n016.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Sun Aug 27 08:37:58 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.19/0.60 start to proof: theBenchmark
% 0.19/0.63 % Version : CSE_E---1.5
% 0.19/0.63 % Problem : theBenchmark.p
% 0.19/0.63 % Proof found
% 0.19/0.63 % SZS status Theorem for theBenchmark.p
% 0.19/0.63 % SZS output start Proof
% See solution above
% 0.19/0.64 % Total time : 0.021000 s
% 0.19/0.64 % SZS output end Proof
% 0.19/0.64 % Total time : 0.024000 s
%------------------------------------------------------------------------------