%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : GRP488-1 : TPTP v9.2.1. Released v2.6.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 : n017.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:14 PM UTC 2026
% Result : Unsatisfiable 1.30s 1.73s
% Output : CNFRefutation 1.30s
% Verified :
% SZS Type : Refutation
% Derivation depth : 22
% Number of leaves : 5
% Syntax : Number of clauses : 38 ( 38 unt; 0 nHn; 11 RR)
% Number of literals : 38 ( 37 equ; 6 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 7 ( 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 : 37 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(identity,axiom,
identity = double_divide(X1,inverse(X1)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',identity) ).
cnf(inverse,axiom,
inverse(X1) = double_divide(X1,identity),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',inverse) ).
cnf(single_axiom,axiom,
double_divide(X1,double_divide(double_divide(double_divide(identity,double_divide(double_divide(X1,identity),double_divide(X2,X3))),X2),identity)) = X3,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',single_axiom) ).
cnf(prove_these_axioms_2,negated_conjecture,
multiply(identity,a2) != a2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_these_axioms_2) ).
cnf(multiply,axiom,
multiply(X1,X2) = double_divide(double_divide(X2,X1),identity),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',multiply) ).
cnf(c_0_5,axiom,
identity = double_divide(X1,inverse(X1)),
identity ).
cnf(c_0_6,axiom,
inverse(X1) = double_divide(X1,identity),
inverse ).
cnf(c_0_7,axiom,
double_divide(X1,double_divide(double_divide(double_divide(identity,double_divide(double_divide(X1,identity),double_divide(X2,X3))),X2),identity)) = X3,
single_axiom ).
cnf(c_0_8,plain,
identity = double_divide(X1,double_divide(X1,identity)),
inference(rw,[status(thm)],[c_0_5,c_0_6]) ).
cnf(c_0_9,plain,
double_divide(X1,double_divide(double_divide(double_divide(identity,identity),double_divide(X1,identity)),identity)) = identity,
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_10,plain,
double_divide(double_divide(identity,identity),double_divide(identity,identity)) = identity,
inference(spm,[status(thm)],[c_0_9,c_0_8]) ).
cnf(c_0_11,plain,
double_divide(X1,double_divide(double_divide(double_divide(identity,double_divide(double_divide(X1,identity),identity)),X2),identity)) = double_divide(X2,identity),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_12,plain,
double_divide(identity,double_divide(double_divide(double_divide(identity,identity),identity),identity)) = identity,
inference(spm,[status(thm)],[c_0_7,c_0_10]) ).
cnf(c_0_13,plain,
double_divide(double_divide(identity,X1),double_divide(double_divide(X1,identity),identity)) = identity,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_11]),c_0_12]) ).
cnf(c_0_14,plain,
double_divide(double_divide(identity,X1),identity) = double_divide(double_divide(X1,identity),identity),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_13]),c_0_11]) ).
cnf(c_0_15,plain,
double_divide(double_divide(X1,identity),double_divide(double_divide(identity,X1),identity)) = identity,
inference(spm,[status(thm)],[c_0_8,c_0_14]) ).
cnf(c_0_16,plain,
double_divide(X1,double_divide(double_divide(double_divide(identity,identity),double_divide(identity,X1)),identity)) = identity,
inference(spm,[status(thm)],[c_0_7,c_0_15]) ).
cnf(c_0_17,plain,
double_divide(double_divide(double_divide(identity,identity),double_divide(identity,X1)),identity) = double_divide(X1,identity),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_16]),c_0_11]) ).
cnf(c_0_18,plain,
double_divide(double_divide(identity,identity),identity) = double_divide(identity,identity),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_9]),c_0_14]),c_0_8]),c_0_10]) ).
cnf(c_0_19,plain,
double_divide(identity,double_divide(double_divide(identity,X1),identity)) = double_divide(X1,identity),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_18]),c_0_8]) ).
cnf(c_0_20,plain,
double_divide(identity,identity) = identity,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_9]),c_0_8]),c_0_10]),c_0_18]) ).
cnf(c_0_21,plain,
double_divide(double_divide(identity,double_divide(identity,X1)),identity) = double_divide(X1,identity),
inference(rw,[status(thm)],[c_0_17,c_0_20]) ).
cnf(c_0_22,plain,
double_divide(double_divide(identity,X1),identity) = double_divide(identity,double_divide(X1,identity)),
inference(spm,[status(thm)],[c_0_19,c_0_21]) ).
cnf(c_0_23,plain,
double_divide(double_divide(identity,double_divide(identity,X1)),identity) = double_divide(double_divide(identity,double_divide(X1,identity)),identity),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_14]),c_0_14]) ).
cnf(c_0_24,plain,
double_divide(double_divide(X1,identity),identity) = double_divide(identity,double_divide(X1,identity)),
inference(rw,[status(thm)],[c_0_14,c_0_22]) ).
cnf(c_0_25,negated_conjecture,
multiply(identity,a2) != a2,
prove_these_axioms_2 ).
cnf(c_0_26,axiom,
multiply(X1,X2) = double_divide(double_divide(X2,X1),identity),
multiply ).
cnf(c_0_27,plain,
double_divide(identity,double_divide(identity,double_divide(X1,identity))) = double_divide(X1,identity),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_23,c_0_21]),c_0_22]),c_0_24]) ).
cnf(c_0_28,negated_conjecture,
double_divide(double_divide(a2,identity),identity) != a2,
inference(rw,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_29,plain,
double_divide(double_divide(double_divide(identity,double_divide(identity,double_divide(X1,X2))),X1),identity) = double_divide(identity,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_7]),c_0_20]) ).
cnf(c_0_30,negated_conjecture,
double_divide(double_divide(identity,a2),identity) != a2,
inference(rw,[status(thm)],[c_0_28,c_0_14]) ).
cnf(c_0_31,plain,
double_divide(identity,X1) = double_divide(X1,identity),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_29]),c_0_21]),c_0_22]),c_0_27]) ).
cnf(c_0_32,negated_conjecture,
double_divide(identity,double_divide(a2,identity)) != a2,
inference(rw,[status(thm)],[c_0_30,c_0_22]) ).
cnf(c_0_33,plain,
double_divide(identity,double_divide(identity,double_divide(identity,X1))) = double_divide(identity,X1),
inference(spm,[status(thm)],[c_0_27,c_0_31]) ).
cnf(c_0_34,plain,
double_divide(X1,double_divide(identity,double_divide(double_divide(identity,double_divide(double_divide(X1,identity),double_divide(X2,X3))),X2))) = X3,
inference(rw,[status(thm)],[c_0_7,c_0_31]) ).
cnf(c_0_35,negated_conjecture,
double_divide(identity,double_divide(identity,a2)) != a2,
inference(rw,[status(thm)],[c_0_32,c_0_31]) ).
cnf(c_0_36,plain,
double_divide(identity,double_divide(identity,X1)) = X1,
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_37,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_35,c_0_36])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : GRP488-1 : TPTP v9.2.1. Released v2.6.0.
% 0.00/0.11 % 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.15/0.32 % Computer : n017.cluster.edu
% 0.15/0.32 % Model : x86_64 x86_64
% 0.15/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.32 % Memory : 8042.1875MB
% 0.15/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.32 % CPULimit : 300
% 0.15/0.32 % WCLimit : 300
% 0.15/0.32 % DateTime : Mon May 4 18:36:42 EDT 2026
% 0.15/0.32 % CPUTime :
% 0.15/0.33 % start to proof: theBenchmark
% 1.30/1.73 % Version : CSE_E---1.7
% 1.30/1.73 % Problem : theBenchmark.p
% 1.30/1.73 % SZS status Unsatisfiable for theBenchmark.p
% 1.30/1.73 % SZS output start CNFRefutation
% See solution above
% 1.30/1.73 % Total time : 1.371s
%------------------------------------------------------------------------------