%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : GRP456-1 : TPTP v9.2.1. Released v2.6.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 : n012.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:09 PM UTC 2026
% Result : Unsatisfiable 1.14s 1.62s
% Output : CNFRefutation 1.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 4
% Syntax : Number of clauses : 24 ( 24 unt; 0 nHn; 5 RR)
% Number of literals : 24 ( 23 equ; 4 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 : 6 ( 6 usr; 4 con; 0-2 aty)
% Number of variables : 38 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(single_axiom,axiom,
divide(divide(identity,divide(X1,divide(X2,divide(divide(divide(X1,X1),X1),X3)))),X3) = X2,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',single_axiom) ).
cnf(identity,axiom,
identity = divide(X1,X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',identity) ).
cnf(prove_these_axioms_3,negated_conjecture,
multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_these_axioms_3) ).
cnf(multiply,axiom,
multiply(X1,X2) = divide(X1,divide(identity,X2)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',multiply) ).
cnf(c_0_4,axiom,
divide(divide(identity,divide(X1,divide(X2,divide(divide(divide(X1,X1),X1),X3)))),X3) = X2,
single_axiom ).
cnf(c_0_5,axiom,
identity = divide(X1,X1),
identity ).
cnf(c_0_6,plain,
divide(divide(identity,divide(X1,divide(X2,divide(divide(identity,X1),X3)))),X3) = X2,
inference(rw,[status(thm)],[c_0_4,c_0_5]) ).
cnf(c_0_7,plain,
divide(divide(identity,divide(X1,identity)),X2) = divide(divide(identity,X1),X2),
inference(spm,[status(thm)],[c_0_6,c_0_5]) ).
cnf(c_0_8,plain,
divide(divide(identity,divide(identity,divide(X1,divide(identity,X2)))),X2) = X1,
inference(spm,[status(thm)],[c_0_6,c_0_5]) ).
cnf(c_0_9,plain,
divide(identity,divide(X1,identity)) = divide(identity,X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_7]),c_0_6]) ).
cnf(c_0_10,plain,
divide(divide(identity,divide(identity,X1)),identity) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_5]),c_0_9]) ).
cnf(c_0_11,plain,
divide(X1,identity) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_10]),c_0_5]),c_0_5]) ).
cnf(c_0_12,plain,
divide(identity,divide(identity,X1)) = X1,
inference(rw,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_13,plain,
divide(identity,divide(X1,divide(X2,divide(identity,X1)))) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_11]),c_0_11]) ).
cnf(c_0_14,plain,
divide(divide(X1,divide(identity,X2)),X2) = X1,
inference(rw,[status(thm)],[c_0_8,c_0_12]) ).
cnf(c_0_15,plain,
divide(identity,divide(X1,X2)) = divide(X2,X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_12]) ).
cnf(c_0_16,negated_conjecture,
multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3)),
prove_these_axioms_3 ).
cnf(c_0_17,axiom,
multiply(X1,X2) = divide(X1,divide(identity,X2)),
multiply ).
cnf(c_0_18,plain,
divide(divide(divide(X1,divide(divide(identity,X2),X3)),X2),X3) = X1,
inference(rw,[status(thm)],[c_0_6,c_0_15]) ).
cnf(c_0_19,negated_conjecture,
divide(divide(a3,divide(identity,b3)),divide(identity,c3)) != divide(a3,divide(identity,divide(b3,divide(identity,c3)))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_16,c_0_17]),c_0_17]),c_0_17]),c_0_17]) ).
cnf(c_0_20,plain,
divide(X1,divide(X2,divide(identity,X3))) = divide(divide(X1,X3),X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_14]),c_0_15]) ).
cnf(c_0_21,negated_conjecture,
divide(divide(a3,divide(identity,b3)),divide(identity,c3)) != divide(a3,divide(divide(identity,c3),b3)),
inference(rw,[status(thm)],[c_0_19,c_0_15]) ).
cnf(c_0_22,plain,
divide(divide(X1,divide(identity,X2)),X3) = divide(X1,divide(X3,X2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_20]),c_0_15]) ).
cnf(c_0_23,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_21,c_0_22])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.06 % Problem : GRP456-1 : TPTP v9.2.1. Released v2.6.0.
% 0.00/0.06 % 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.06/0.24 % Computer : n012.cluster.edu
% 0.06/0.24 % Model : x86_64 x86_64
% 0.06/0.24 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.06/0.24 % Memory : 8042.1875MB
% 0.06/0.24 % OS : Linux 3.10.0-693.el7.x86_64
% 0.06/0.24 % CPULimit : 300
% 0.06/0.24 % WCLimit : 300
% 0.06/0.24 % DateTime : Mon May 4 18:37:15 EDT 2026
% 0.06/0.24 % CPUTime :
% 0.06/0.25 % start to proof: theBenchmark
% 1.14/1.62 % Version : CSE_E---1.7
% 1.14/1.62 % Problem : theBenchmark.p
% 1.14/1.62 % SZS status Unsatisfiable for theBenchmark.p
% 1.14/1.62 % SZS output start CNFRefutation
% See solution above
% 1.14/1.62 % Total time : 1.363s
%------------------------------------------------------------------------------