TSTP Solution File: BOO067-1 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : BOO067-1 : TPTP v8.1.2. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% Computer : n007.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:06:02 EDT 2023
% Result : Unsatisfiable 0.20s 0.66s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 9
% Syntax : Number of formulae : 40 ( 33 unt; 7 typ; 0 def)
% Number of atoms : 33 ( 32 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 4 ( 4 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 2 ( 1 avg)
% Maximal term depth : 7 ( 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 : 7 ( 7 usr; 5 con; 0-3 aty)
% Number of variables : 120 ( 2 sgn; 0 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_22,type,
inverse: $i > $i ).
tff(decl_23,type,
multiply: ( $i * $i * $i ) > $i ).
tff(decl_24,type,
d: $i ).
tff(decl_25,type,
e: $i ).
tff(decl_26,type,
a: $i ).
tff(decl_27,type,
b: $i ).
tff(decl_28,type,
c: $i ).
cnf(single_axiom,axiom,
multiply(multiply(X1,inverse(X1),X2),inverse(multiply(multiply(X3,X4,X5),X6,multiply(X3,X4,X7))),multiply(X4,multiply(X7,X6,X5),X3)) = X2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',single_axiom) ).
cnf(prove_tba_axioms_1,negated_conjecture,
multiply(multiply(d,e,a),b,multiply(d,e,c)) != multiply(d,e,multiply(a,b,c)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_tba_axioms_1) ).
cnf(c_0_2,axiom,
multiply(multiply(X1,inverse(X1),X2),inverse(multiply(multiply(X3,X4,X5),X6,multiply(X3,X4,X7))),multiply(X4,multiply(X7,X6,X5),X3)) = X2,
single_axiom ).
cnf(c_0_3,plain,
multiply(multiply(X1,inverse(X1),X2),inverse(multiply(multiply(X3,X4,multiply(X5,multiply(X6,X7,X8),X9)),inverse(multiply(multiply(X9,X5,X8),X7,multiply(X9,X5,X6))),multiply(X3,X4,multiply(X10,inverse(X10),X11)))),multiply(X4,X11,X3)) = X2,
inference(spm,[status(thm)],[c_0_2,c_0_2]) ).
cnf(c_0_4,plain,
multiply(multiply(X1,X2,X3),inverse(multiply(multiply(X4,X5,X6),X7,multiply(X4,X5,X8))),multiply(X5,multiply(X8,X7,X6),X4)) = multiply(X2,multiply(X3,inverse(multiply(X1,X2,X9)),X9),X1),
inference(spm,[status(thm)],[c_0_2,c_0_2]) ).
cnf(c_0_5,plain,
multiply(multiply(X1,inverse(X1),X2),inverse(multiply(X3,inverse(X3),multiply(X4,inverse(X4),X5))),multiply(inverse(X3),X5,X3)) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_3,c_0_3]),c_0_2]) ).
cnf(c_0_6,plain,
multiply(inverse(X1),multiply(X2,inverse(multiply(X1,inverse(X1),X3)),X3),X1) = X2,
inference(spm,[status(thm)],[c_0_2,c_0_4]) ).
cnf(c_0_7,plain,
multiply(inverse(X1),X2,X1) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_2,c_0_5]),c_0_2]) ).
cnf(c_0_8,plain,
multiply(X1,inverse(multiply(X2,inverse(X2),X3)),X3) = X1,
inference(rw,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_9,plain,
inverse(multiply(X1,inverse(X1),X2)) = inverse(X2),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_10,plain,
multiply(multiply(X1,inverse(X1),X2),inverse(multiply(X3,inverse(X3),multiply(X4,inverse(X4),X5))),X5) = X2,
inference(rw,[status(thm)],[c_0_5,c_0_7]) ).
cnf(c_0_11,plain,
multiply(X1,inverse(X2),X2) = X1,
inference(rw,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_12,plain,
multiply(X1,inverse(X1),X2) = X2,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_10,c_0_9]),c_0_9]),c_0_11]) ).
cnf(c_0_13,plain,
multiply(X1,multiply(X2,inverse(multiply(X3,X1,X4)),X4),X3) = multiply(X1,multiply(X2,inverse(multiply(X3,X1,X5)),X5),X3),
inference(spm,[status(thm)],[c_0_4,c_0_4]) ).
cnf(c_0_14,plain,
inverse(inverse(X1)) = X1,
inference(spm,[status(thm)],[c_0_7,c_0_12]) ).
cnf(c_0_15,plain,
multiply(X1,multiply(multiply(X2,X1,X3),inverse(multiply(X2,X1,X4)),X4),X2) = multiply(X1,X3,X2),
inference(spm,[status(thm)],[c_0_13,c_0_12]) ).
cnf(c_0_16,plain,
multiply(X1,X2,inverse(X1)) = X2,
inference(spm,[status(thm)],[c_0_7,c_0_14]) ).
cnf(c_0_17,plain,
multiply(X1,inverse(multiply(multiply(X2,X3,X4),X5,multiply(X2,X3,X6))),multiply(X3,multiply(X6,X5,X4),X2)) = X1,
inference(rw,[status(thm)],[c_0_2,c_0_12]) ).
cnf(c_0_18,plain,
multiply(X1,multiply(X1,inverse(multiply(X2,X1,X3)),X3),X2) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_11]) ).
cnf(c_0_19,plain,
multiply(inverse(X1),X1,X2) = X2,
inference(spm,[status(thm)],[c_0_12,c_0_14]) ).
cnf(c_0_20,plain,
multiply(X1,inverse(multiply(X2,X3,X3)),X3) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_12]) ).
cnf(c_0_21,plain,
multiply(multiply(X1,multiply(multiply(X2,X3,X4),inverse(multiply(multiply(X2,X3,X5),X1,X6)),X6),multiply(X2,X3,X5)),inverse(multiply(multiply(X7,X8,X9),X10,multiply(X7,X8,X11))),multiply(X8,multiply(X11,X10,X9),X7)) = multiply(X3,multiply(X4,X1,X5),X2),
inference(spm,[status(thm)],[c_0_2,c_0_4]) ).
cnf(c_0_22,plain,
multiply(X1,multiply(X2,inverse(multiply(X3,X1,X4)),X4),X3) = multiply(X3,X1,X2),
inference(rw,[status(thm)],[c_0_4,c_0_17]) ).
cnf(c_0_23,plain,
multiply(X1,X2,X2) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_14]) ).
cnf(c_0_24,plain,
multiply(multiply(X1,X2,X3),X4,multiply(X1,X2,X5)) = multiply(X2,multiply(X5,X4,X3),X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_21,c_0_17]),c_0_22]) ).
cnf(c_0_25,negated_conjecture,
multiply(multiply(d,e,a),b,multiply(d,e,c)) != multiply(d,e,multiply(a,b,c)),
prove_tba_axioms_1 ).
cnf(c_0_26,plain,
multiply(X1,X2,X3) = multiply(X3,X1,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_11]) ).
cnf(c_0_27,plain,
multiply(X1,X2,X3) = multiply(X3,X2,X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_12]),c_0_12]),c_0_7]) ).
cnf(c_0_28,negated_conjecture,
multiply(b,multiply(d,e,c),multiply(d,e,a)) != multiply(d,e,multiply(a,b,c)),
inference(rw,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_29,plain,
multiply(X1,X2,X3) = multiply(X1,X3,X2),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_30,negated_conjecture,
multiply(b,multiply(d,e,a),multiply(d,e,c)) != multiply(d,e,multiply(a,b,c)),
inference(rw,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_31,plain,
multiply(X1,multiply(X2,X3,X4),multiply(X2,X3,X5)) = multiply(X3,multiply(X4,X1,X5),X2),
inference(spm,[status(thm)],[c_0_26,c_0_24]) ).
cnf(c_0_32,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_30,c_0_31]),c_0_26])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.13 % Problem : BOO067-1 : TPTP v8.1.2. Released v2.6.0.
% 0.13/0.13 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% 0.13/0.35 % Computer : n007.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Sun Aug 27 07:40:12 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.20/0.58 start to proof: theBenchmark
% 0.20/0.66 % Version : CSE_E---1.5
% 0.20/0.66 % Problem : theBenchmark.p
% 0.20/0.66 % Proof found
% 0.20/0.66 % SZS status Theorem for theBenchmark.p
% 0.20/0.66 % SZS output start Proof
% See solution above
% 0.20/0.66 % Total time : 0.070000 s
% 0.20/0.66 % SZS output end Proof
% 0.20/0.66 % Total time : 0.073000 s
%------------------------------------------------------------------------------