%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : GRP614-1 : TPTP v9.3.1. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n015.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Thu Sep 24 12:40:22 PM UTC 2026
% Result : Unsatisfiable 0.27s 0.53s
% Output : CNFRefutation 0.27s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 3
% 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 : 11 ( 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 : 43 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(single_axiom,axiom,
double_divide(inverse(double_divide(inverse(double_divide(X1,inverse(X2))),X3)),double_divide(X1,X3)) = X2,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',single_axiom) ).
cnf(prove_these_axioms_2,negated_conjecture,
multiply(multiply(inverse(b2),b2),a2) != a2,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_these_axioms_2) ).
cnf(multiply,axiom,
multiply(X1,X2) = inverse(double_divide(X2,X1)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',multiply) ).
cnf(c_0_3,axiom,
double_divide(inverse(double_divide(inverse(double_divide(X1,inverse(X2))),X3)),double_divide(X1,X3)) = X2,
single_axiom ).
cnf(c_0_4,plain,
double_divide(inverse(double_divide(inverse(double_divide(inverse(double_divide(inverse(double_divide(X1,inverse(X2))),X3)),inverse(X4))),double_divide(X1,X3))),X2) = X4,
inference(spm,[status(thm)],[c_0_3,c_0_3]) ).
cnf(c_0_5,plain,
double_divide(inverse(double_divide(inverse(X1),inverse(X2))),X1) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_4,c_0_4]),c_0_3]) ).
cnf(c_0_6,plain,
double_divide(inverse(X1),double_divide(inverse(X2),X2)) = X1,
inference(spm,[status(thm)],[c_0_3,c_0_5]) ).
cnf(c_0_7,plain,
double_divide(inverse(X1),double_divide(inverse(double_divide(X2,inverse(X1))),double_divide(X2,inverse(X3)))) = X3,
inference(spm,[status(thm)],[c_0_3,c_0_3]) ).
cnf(c_0_8,plain,
double_divide(inverse(double_divide(inverse(X1),X1)),inverse(X2)) = X2,
inference(spm,[status(thm)],[c_0_5,c_0_6]) ).
cnf(c_0_9,plain,
double_divide(inverse(X1),double_divide(inverse(X1),X2)) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_8]),c_0_8]) ).
cnf(c_0_10,plain,
double_divide(inverse(double_divide(inverse(X1),X1)),X2) = inverse(X2),
inference(spm,[status(thm)],[c_0_9,c_0_8]) ).
cnf(c_0_11,plain,
inverse(inverse(X1)) = X1,
inference(rw,[status(thm)],[c_0_8,c_0_10]) ).
cnf(c_0_12,negated_conjecture,
multiply(multiply(inverse(b2),b2),a2) != a2,
inference(fof_simplification,[status(thm)],[prove_these_axioms_2]) ).
cnf(c_0_13,plain,
double_divide(X1,double_divide(inverse(X2),X2)) = inverse(X1),
inference(spm,[status(thm)],[c_0_6,c_0_11]) ).
cnf(c_0_14,negated_conjecture,
multiply(multiply(inverse(b2),b2),a2) != a2,
c_0_12 ).
cnf(c_0_15,axiom,
multiply(X1,X2) = inverse(double_divide(X2,X1)),
multiply ).
cnf(c_0_16,plain,
double_divide(X1,double_divide(X1,X2)) = X2,
inference(spm,[status(thm)],[c_0_9,c_0_11]) ).
cnf(c_0_17,plain,
double_divide(X1,double_divide(X2,inverse(X2))) = inverse(X1),
inference(spm,[status(thm)],[c_0_13,c_0_11]) ).
cnf(c_0_18,plain,
double_divide(inverse(X1),double_divide(X2,inverse(X1))) = X2,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_13]),c_0_11]),c_0_11]) ).
cnf(c_0_19,negated_conjecture,
inverse(double_divide(a2,inverse(double_divide(b2,inverse(b2))))) != a2,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_14,c_0_15]),c_0_15]) ).
cnf(c_0_20,plain,
double_divide(X1,inverse(X1)) = double_divide(X2,inverse(X2)),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_21,plain,
double_divide(X1,double_divide(X2,X1)) = X2,
inference(spm,[status(thm)],[c_0_18,c_0_11]) ).
cnf(c_0_22,negated_conjecture,
inverse(double_divide(a2,inverse(double_divide(X1,inverse(X1))))) != a2,
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_23,plain,
double_divide(X1,X2) = double_divide(X2,X1),
inference(spm,[status(thm)],[c_0_16,c_0_21]) ).
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)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_10]),c_0_11]),c_0_23]),c_0_11]),c_0_17]),c_0_11])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : GRP614-1 : TPTP v9.3.1. Released v2.6.0.
% 0.00/0.07 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.17/0.43 % Computer : n015.cluster.edu
% 0.17/0.43 % Model : x86_64 x86_64
% 0.17/0.43 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.43 % Memory : 8046.5625MB
% 0.17/0.43 % OS : Linux 6.8.0-71-generic
% 0.17/0.43 % CPULimit : 300
% 0.17/0.43 % WCLimit : 300
% 0.17/0.43 % DateTime : Sun Sep 20 20:21:35 UTC 2026
% 0.17/0.43 % CPUTime :
% 0.17/0.43 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.17/0.50 Running first-order theorem proving
% 0.17/0.50 Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.27/0.53 % Version: 3.5.1
% 0.27/0.53 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.27/0.53 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.27/0.53 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.27/0.53 % Starting new_bool_3 with 300s (1) cores
% 0.27/0.53 % Starting new_bool_1 with 300s (1) cores
% 0.27/0.53 % Starting sh5l with 300s (1) cores
% 0.27/0.53 % G-E--_302_C18_F1_URBAN_RG_S04BN with pid 3852980 completed with status 0
% 0.27/0.53 % Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.27/0.53 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.27/0.53 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.27/0.53 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.27/0.53 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.27/0.53 % No SInE strategy applied
% 0.27/0.53 % Search class: FUUPF-FFSF21-DFFFFFNN
% 0.27/0.53 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.27/0.53 % Starting SubtermCWHack with 136s (1) cores
% 0.27/0.53 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.27/0.53 % Starting U----_116XG_C05_02_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.27/0.53 % Starting new_bool_3 with 136s (1) cores
% 0.27/0.53 % Starting new_bool_1 with 136s (1) cores
% 0.27/0.53 % U----_116XG_C05_02_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with pid 3852987 completed with status 0
% 0.27/0.53 % Result found by U----_116XG_C05_02_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN
% 0.27/0.53 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.27/0.53 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.27/0.53 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.27/0.53 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.27/0.53 % No SInE strategy applied
% 0.27/0.53 % Search class: FUUPF-FFSF21-DFFFFFNN
% 0.27/0.53 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.27/0.53 % Starting SubtermCWHack with 136s (1) cores
% 0.27/0.53 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.27/0.53 % Starting U----_116XG_C05_02_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.27/0.53 % Preprocessing time : 0.001 s
% 0.27/0.53 % Presaturation interreduction done
% 0.27/0.53
% 0.27/0.53 % Proof found!
% 0.27/0.53 % SZS status Unsatisfiable
% 0.27/0.53 % SZS output start CNFRefutation
% See solution above
% 0.27/0.53 % Parsed axioms : 3
% 0.27/0.53 % Removed by relevancy pruning/SinE : 0
% 0.27/0.53 % Initial clauses : 3
% 0.27/0.53 % Removed in clause preprocessing : 1
% 0.27/0.53 % Initial clauses in saturation : 2
% 0.27/0.53 % Processed clauses : 34
% 0.27/0.53 % ...of these trivial : 9
% 0.27/0.53 % ...subsumed : 0
% 0.27/0.53 % ...remaining for further processing : 25
% 0.27/0.53 % Other redundant clauses eliminated : 0
% 0.27/0.53 % Clauses deleted for lack of memory : 0
% 0.27/0.53 % Backward-subsumed : 1
% 0.27/0.53 % Backward-rewritten : 11
% 0.27/0.53 % Generated clauses : 384
% 0.27/0.53 % ...of the previous two non-redundant : 319
% 0.27/0.53 % ...aggressively subsumed : 0
% 0.27/0.53 % Contextual simplify-reflections : 0
% 0.27/0.53 % Paramodulations : 384
% 0.27/0.53 % Factorizations : 0
% 0.27/0.53 % NegExts : 0
% 0.27/0.53 % Equation resolutions : 0
% 0.27/0.53 % Disequality decompositions : 0
% 0.27/0.53 % Total rewrite steps : 222
% 0.27/0.53 % ...of those cached : 141
% 0.27/0.53 % Propositional unsat checks : 0
% 0.27/0.53 % Propositional check models : 0
% 0.27/0.53 % Propositional check unsatisfiable : 0
% 0.27/0.53 % Propositional clauses : 0
% 0.27/0.53 % Propositional clauses after purity: 0
% 0.27/0.53 % Propositional unsat core size : 0
% 0.27/0.53 % Propositional preprocessing time : 0.000
% 0.27/0.53 % Propositional encoding time : 0.000
% 0.27/0.53 % Propositional solver time : 0.000
% 0.27/0.53 % Success case prop preproc time : 0.000
% 0.27/0.53 % Success case prop encoding time : 0.000
% 0.27/0.53 % Success case prop solver time : 0.000
% 0.27/0.53 % Current number of processed clauses : 11
% 0.27/0.53 % Positive orientable unit clauses : 8
% 0.27/0.53 % Positive unorientable unit clauses: 2
% 0.27/0.53 % Negative unit clauses : 1
% 0.27/0.53 % Non-unit-clauses : 0
% 0.27/0.53 % Current number of unprocessed clauses: 193
% 0.27/0.53 % ...number of literals in the above : 193
% 0.27/0.53 % Current number of archived formulas : 0
% 0.27/0.53 % Current number of archived clauses : 15
% 0.27/0.53 % Clause-clause subsumption calls (NU) : 0
% 0.27/0.53 % Rec. Clause-clause subsumption calls : 0
% 0.27/0.53 % Non-unit clause-clause subsumptions : 0
% 0.27/0.53 % Unit Clause-clause subsumption calls : 20
% 0.27/0.53 % Rewrite failures with RHS unbound : 0
% 0.27/0.53 % BW rewrite match attempts : 106
% 0.27/0.53 % BW rewrite match successes : 50
% 0.27/0.53 % Condensation attempts : 0
% 0.27/0.53 % Condensation successes : 0
% 0.27/0.53 % Termbank termtop insertions : 3765
% 0.27/0.53 % Search garbage collected termcells : 2
% 0.27/0.53
% 0.27/0.53 % -------------------------------------------------
% 0.27/0.53 % User time : 0.006 s
% 0.27/0.53 % System time : 0.004 s
% 0.27/0.53 % Total time : 0.009 s
% 0.27/0.53 % Maximum resident set size: 3632 pages
% 0.27/0.53
% 0.27/0.53 % -------------------------------------------------
% 0.27/0.53 % User time : 0.028 s
% 0.27/0.53 % System time : 0.019 s
% 0.27/0.53 % Total time : 0.047 s
% 0.27/0.53 % Maximum resident set size: 4608 pages
% 0.27/0.53 % E exiting
%------------------------------------------------------------------------------