%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : BOO034-1 : TPTP v9.2.1. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox2/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox2/solver/bin/cse --final-prover /export/starexec/sandbox2/solver/bin/eprover --proof-time %d --global-time-limit %d
% Computer : n003.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 : Tue May 5 04:11:21 PM UTC 2026
% Result : Unsatisfiable 1.35s 1.75s
% Output : CNFRefutation 1.35s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 5
% Syntax : Number of clauses : 25 ( 25 unt; 0 nHn; 6 RR)
% Number of literals : 25 ( 24 equ; 5 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 5 ( 2 avg)
% 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 : 53 ( 5 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(associativity,axiom,
multiply(multiply(X1,X2,X3),X4,multiply(X1,X2,X5)) = multiply(X1,X2,multiply(X3,X4,X5)),
file('/export/starexec/sandbox2/benchmark/Axioms/BOO001-0.ax',associativity) ).
cnf(right_inverse,axiom,
multiply(X1,X2,inverse(X2)) = X1,
file('/export/starexec/sandbox2/benchmark/Axioms/BOO001-0.ax',right_inverse) ).
cnf(ternary_multiply_1,axiom,
multiply(X1,X2,X2) = X2,
file('/export/starexec/sandbox2/benchmark/Axioms/BOO001-0.ax',ternary_multiply_1) ).
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/sandbox2/benchmark/theBenchmark.p',prove_single_axiom) ).
cnf(ternary_multiply_2,axiom,
multiply(X1,X1,X2) = X1,
file('/export/starexec/sandbox2/benchmark/Axioms/BOO001-0.ax',ternary_multiply_2) ).
cnf(c_0_5,axiom,
multiply(multiply(X1,X2,X3),X4,multiply(X1,X2,X5)) = multiply(X1,X2,multiply(X3,X4,X5)),
associativity ).
cnf(c_0_6,axiom,
multiply(X1,X2,inverse(X2)) = X1,
right_inverse ).
cnf(c_0_7,axiom,
multiply(X1,X2,X2) = X2,
ternary_multiply_1 ).
cnf(c_0_8,plain,
multiply(multiply(X1,X2,X3),X4,X1) = multiply(X1,X2,multiply(X3,X4,inverse(X2))),
inference(spm,[status(thm)],[c_0_5,c_0_6]) ).
cnf(c_0_9,plain,
multiply(X1,X2,multiply(X3,X1,X4)) = multiply(X3,X1,multiply(X1,X2,X4)),
inference(spm,[status(thm)],[c_0_5,c_0_7]) ).
cnf(c_0_10,plain,
multiply(multiply(X1,X2,X3),inverse(X2),X1) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_7]),c_0_6]) ).
cnf(c_0_11,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_12,plain,
multiply(X1,X2,multiply(X1,X3,X4)) = multiply(X1,X3,multiply(inverse(X3),X2,X4)),
inference(spm,[status(thm)],[c_0_5,c_0_6]) ).
cnf(c_0_13,plain,
multiply(X1,X2,multiply(X3,X1,X2)) = multiply(X3,X1,X2),
inference(spm,[status(thm)],[c_0_9,c_0_7]) ).
cnf(c_0_14,axiom,
multiply(X1,X1,X2) = X1,
ternary_multiply_2 ).
cnf(c_0_15,plain,
multiply(X1,inverse(X1),X2) = X2,
inference(spm,[status(thm)],[c_0_10,c_0_7]) ).
cnf(c_0_16,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_11,c_0_5]) ).
cnf(c_0_17,plain,
multiply(inverse(X1),X2,X1) = X2,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_7]),c_0_14]) ).
cnf(c_0_18,plain,
inverse(inverse(X1)) = X1,
inference(spm,[status(thm)],[c_0_6,c_0_15]) ).
cnf(c_0_19,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_16,c_0_15]) ).
cnf(c_0_20,plain,
multiply(X1,X2,X3) = multiply(X1,X3,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_17]),c_0_7]) ).
cnf(c_0_21,plain,
multiply(X1,X2,inverse(X1)) = X2,
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_22,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_19,c_0_20]),c_0_20]),c_0_20]) ).
cnf(c_0_23,plain,
multiply(X1,X2,X3) = multiply(X3,X1,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_21]),c_0_6]) ).
cnf(c_0_24,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_22,c_0_23]),c_0_23]),c_0_20]),c_0_6])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : BOO034-1 : TPTP v9.2.1. Released v2.2.0.
% 0.00/0.12 % Command : /export/starexec/sandbox2/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox2/solver/bin/cse --final-prover /export/starexec/sandbox2/solver/bin/eprover --proof-time %d --global-time-limit %d
% 0.16/0.33 % Computer : n003.cluster.edu
% 0.16/0.33 % Model : x86_64 x86_64
% 0.16/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.33 % Memory : 8042.1875MB
% 0.16/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.33 % CPULimit : 300
% 0.16/0.33 % WCLimit : 300
% 0.16/0.33 % DateTime : Tue May 5 10:44:43 EDT 2026
% 0.16/0.33 % CPUTime :
% 0.16/0.34 % start to proof: theBenchmark
% 1.35/1.75 % Version : CSE_E---1.7
% 1.35/1.75 % Problem : theBenchmark.p
% 1.35/1.75 % SZS status Unsatisfiable for theBenchmark.p
% 1.35/1.75 % SZS output start CNFRefutation
% See solution above
% 1.35/1.75 % Total time : 1.371s
%------------------------------------------------------------------------------