%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : GRP560-1 : TPTP v9.2.1. Bugfixed v2.7.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox/solver/bin/cse --final-prover /export/starexec/sandbox/solver/bin/eprover --proof-time %d --global-time-limit %d
% Computer : n001.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:26:24 PM UTC 2026
% Result : Unsatisfiable 1.28s 1.73s
% Output : CNFRefutation 1.28s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 3
% Syntax : Number of clauses : 23 ( 23 unt; 0 nHn; 4 RR)
% Number of literals : 23 ( 22 equ; 3 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 8 ( 2 avg)
% 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 : 41 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(single_axiom,axiom,
divide(X1,inverse(divide(divide(X2,X3),divide(X1,X3)))) = X2,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',single_axiom) ).
cnf(prove_these_axioms_4,negated_conjecture,
multiply(a,b) != multiply(b,a),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_these_axioms_4) ).
cnf(multiply,axiom,
multiply(X1,X2) = divide(X1,inverse(X2)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',multiply) ).
cnf(c_0_3,axiom,
divide(X1,inverse(divide(divide(X2,X3),divide(X1,X3)))) = X2,
single_axiom ).
cnf(c_0_4,plain,
divide(X1,inverse(divide(X2,divide(X1,inverse(divide(divide(X2,X3),divide(X4,X3))))))) = X4,
inference(spm,[status(thm)],[c_0_3,c_0_3]) ).
cnf(c_0_5,plain,
divide(X1,inverse(divide(X2,X2))) = X1,
inference(spm,[status(thm)],[c_0_4,c_0_3]) ).
cnf(c_0_6,plain,
divide(X1,inverse(divide(X2,X1))) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_3,c_0_5]),c_0_5]) ).
cnf(c_0_7,plain,
divide(inverse(divide(X1,X2)),inverse(X1)) = X2,
inference(spm,[status(thm)],[c_0_6,c_0_6]) ).
cnf(c_0_8,plain,
divide(inverse(X1),inverse(X2)) = inverse(divide(X1,X2)),
inference(spm,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_9,plain,
inverse(divide(divide(X1,X2),X1)) = X2,
inference(rw,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_10,plain,
inverse(divide(X1,divide(X2,X2))) = inverse(X1),
inference(spm,[status(thm)],[c_0_5,c_0_8]) ).
cnf(c_0_11,plain,
inverse(divide(divide(X1,X1),X2)) = X2,
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_12,plain,
divide(X1,divide(X1,X2)) = X2,
inference(spm,[status(thm)],[c_0_3,c_0_11]) ).
cnf(c_0_13,plain,
inverse(divide(X1,X2)) = divide(X2,X1),
inference(spm,[status(thm)],[c_0_9,c_0_12]) ).
cnf(c_0_14,plain,
divide(X1,divide(X2,X2)) = X1,
inference(spm,[status(thm)],[c_0_5,c_0_11]) ).
cnf(c_0_15,plain,
divide(divide(X1,X1),X2) = inverse(X2),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_16,negated_conjecture,
multiply(a,b) != multiply(b,a),
prove_these_axioms_4 ).
cnf(c_0_17,axiom,
multiply(X1,X2) = divide(X1,inverse(X2)),
multiply ).
cnf(c_0_18,plain,
divide(inverse(X1),inverse(X2)) = divide(X2,X1),
inference(rw,[status(thm)],[c_0_8,c_0_13]) ).
cnf(c_0_19,plain,
inverse(inverse(X1)) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_15]),c_0_15]) ).
cnf(c_0_20,negated_conjecture,
divide(b,inverse(a)) != divide(a,inverse(b)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_16,c_0_17]),c_0_17]) ).
cnf(c_0_21,plain,
divide(X1,inverse(X2)) = divide(X2,inverse(X1)),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_22,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_20,c_0_21])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : GRP560-1 : TPTP v9.2.1. Bugfixed v2.7.0.
% 0.00/0.12 % Command : /export/starexec/sandbox/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox/solver/bin/cse --final-prover /export/starexec/sandbox/solver/bin/eprover --proof-time %d --global-time-limit %d
% 0.16/0.34 % Computer : n001.cluster.edu
% 0.16/0.34 % Model : x86_64 x86_64
% 0.16/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.34 % Memory : 8042.1875MB
% 0.16/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.34 % CPULimit : 300
% 0.16/0.34 % WCLimit : 300
% 0.16/0.34 % DateTime : Mon May 4 18:44:18 EDT 2026
% 0.16/0.34 % CPUTime :
% 0.16/0.35 % start to proof: theBenchmark
% 1.28/1.73 % Version : CSE_E---1.7
% 1.28/1.73 % Problem : theBenchmark.p
% 1.28/1.73 % SZS status Unsatisfiable for theBenchmark.p
% 1.28/1.73 % SZS output start CNFRefutation
% See solution above
% 1.28/1.73 % Total time : 1.369s
%------------------------------------------------------------------------------