%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : GRP460-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 : n015.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:10 PM UTC 2026
% Result : Unsatisfiable 0.22s 1.61s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named c_0_6)
% Comments :
%------------------------------------------------------------------------------
cnf(prove_these_axioms_1,negated_conjecture,
multiply(inverse(a1),a1) != identity,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_these_axioms_1) ).
cnf(inverse,axiom,
inverse(X1) = divide(identity,X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',inverse) ).
cnf(multiply,axiom,
multiply(X1,X2) = divide(X1,divide(identity,X2)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',multiply) ).
cnf(single_axiom,axiom,
divide(X1,divide(divide(divide(identity,X2),X3),divide(divide(divide(X1,X1),X1),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(i_0_5,negated_conjecture,
multiply(inverse(a1),a1) != identity,
prove_these_axioms_1 ).
cnf(i_0_6,axiom,
inverse(X1) = divide(identity,X1),
inverse ).
cnf(i_0_7,axiom,
multiply(X1,X2) = divide(X1,divide(identity,X2)),
multiply ).
cnf(i_0_8,axiom,
divide(X1,divide(divide(divide(identity,X2),X3),divide(divide(divide(X1,X1),X1),X3))) = X2,
single_axiom,
[final] ).
cnf(i_0_9,negated_conjecture,
divide(divide(identity,a1),divide(identity,a1)) != identity,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[i_0_5,c_0_6]),c_0_7]),
[final] ).
cnf(i_0_10,axiom,
identity = divide(X1,X1),
identity,
[final] ).
cnf(i_0_11,axiom,
X1 = X1 ).
cnf(i_0_12,axiom,
( X1 = X2
| X2 != X1 ) ).
cnf(i_0_13,axiom,
( X1 = X2
| X1 != X3
| X3 != X2 ) ).
cnf(i_0_14,axiom,
( X1 != X2
| divide(X1,X3) = divide(X2,X3) ) ).
cnf(i_0_15,axiom,
( X1 != X2
| divide(X3,X1) = divide(X3,X2) ) ).
cnf(i_0_11_001,axiom,
X1 = X1 ).
cnf(i_0_12_002,axiom,
( X1 = X2
| X2 != X1 ) ).
cnf(i_0_13_003,axiom,
( X1 = X2
| X1 != X3
| X3 != X2 ) ).
cnf(i_0_14_004,axiom,
( X1 != X2
| divide(X1,X3) = divide(X2,X3) ) ).
cnf(i_0_15_005,axiom,
( X1 != X2
| divide(X3,X1) = divide(X3,X2) ) ).
cnf(i_0_16,plain,
$false,
inference(scs_inference,[],[i_0_9,i_0_10,i_0_12]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : GRP460-1 : TPTP v9.2.1. Released v2.6.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.15/0.33 % Computer : n015.cluster.edu
% 0.15/0.33 % Model : x86_64 x86_64
% 0.15/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.33 % Memory : 8042.1875MB
% 0.15/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.33 % CPULimit : 300
% 0.15/0.33 % WCLimit : 300
% 0.15/0.33 % DateTime : Mon May 4 18:37:16 EDT 2026
% 0.15/0.33 % CPUTime :
% 0.15/0.34 % start to proof: theBenchmark
% 0.22/1.61 % Version : CSE_E---1.7
% 0.22/1.61 % Problem : theBenchmark.p
% 0.22/1.61 % SZS status Unsatisfiable for theBenchmark.p
% 0.22/1.61 % SZS output start CNFRefutation
% See solution above
% 0.22/1.62 % Total time : 1.270s
%------------------------------------------------------------------------------