%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : GRP589-1 : TPTP v9.3.1. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n005.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:44:18 PM UTC 2026
% Result : Unsatisfiable 0.13s 0.41s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 3
% Syntax : Number of clauses : 15 ( 15 unt; 0 nHn; 5 RR)
% Number of literals : 15 ( 14 equ; 4 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 10 ( 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 : 24 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(single_axiom,axiom,
double_divide(inverse(double_divide(double_divide(X1,X2),inverse(double_divide(X1,inverse(X3))))),X2) = X3,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',single_axiom) ).
cnf(prove_these_axioms_1,negated_conjecture,
multiply(inverse(a1),a1) != multiply(inverse(b1),b1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_these_axioms_1) ).
cnf(multiply,axiom,
multiply(X1,X2) = inverse(double_divide(X2,X1)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',multiply) ).
cnf(c_0_3,axiom,
double_divide(inverse(double_divide(double_divide(X1,X2),inverse(double_divide(X1,inverse(X3))))),X2) = X3,
single_axiom ).
cnf(c_0_4,plain,
double_divide(inverse(double_divide(double_divide(inverse(double_divide(double_divide(X1,inverse(X2)),inverse(double_divide(X1,inverse(X3))))),X4),inverse(X3))),X4) = X2,
inference(spm,[status(thm)],[c_0_3,c_0_3]) ).
cnf(c_0_5,plain,
double_divide(inverse(double_divide(X1,inverse(X1))),inverse(X2)) = X2,
inference(spm,[status(thm)],[c_0_4,c_0_3]) ).
cnf(c_0_6,plain,
double_divide(inverse(double_divide(X1,inverse(X2))),inverse(X1)) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_3,c_0_5]),c_0_5]) ).
cnf(c_0_7,negated_conjecture,
multiply(inverse(a1),a1) != multiply(inverse(b1),b1),
inference(fof_simplification,[status(thm)],[prove_these_axioms_1]) ).
cnf(c_0_8,plain,
double_divide(inverse(X1),inverse(inverse(double_divide(X2,inverse(X1))))) = X2,
inference(spm,[status(thm)],[c_0_6,c_0_6]) ).
cnf(c_0_9,negated_conjecture,
multiply(inverse(a1),a1) != multiply(inverse(b1),b1),
c_0_7 ).
cnf(c_0_10,axiom,
multiply(X1,X2) = inverse(double_divide(X2,X1)),
multiply ).
cnf(c_0_11,plain,
inverse(double_divide(X1,inverse(double_divide(X2,inverse(X2))))) = X1,
inference(spm,[status(thm)],[c_0_5,c_0_8]) ).
cnf(c_0_12,negated_conjecture,
inverse(double_divide(b1,inverse(b1))) != inverse(double_divide(a1,inverse(a1))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_9,c_0_10]),c_0_10]) ).
cnf(c_0_13,plain,
double_divide(X1,inverse(X1)) = double_divide(X2,inverse(X2)),
inference(spm,[status(thm)],[c_0_6,c_0_11]) ).
cnf(c_0_14,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_13]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : GRP589-1 : TPTP v9.3.1. Released v2.6.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.07/0.35 % Computer : n005.cluster.edu
% 0.07/0.35 % Model : x86_64 x86_64
% 0.07/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.35 % Memory : 8046.5625MB
% 0.07/0.35 % OS : Linux 6.8.0-71-generic
% 0.07/0.35 % CPULimit : 300
% 0.07/0.35 % WCLimit : 300
% 0.07/0.35 % DateTime : Sun Sep 20 20:17:18 UTC 2026
% 0.07/0.35 % CPUTime :
% 0.07/0.35 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.13/0.39 Running first-order theorem proving
% 0.13/0.39 Running: /export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p
% 0.13/0.41 % Version: 3.5.1
% 0.13/0.41 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.13/0.41 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.41 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.13/0.41 % Starting new_bool_3 with 300s (1) cores
% 0.13/0.41 % Starting new_bool_1 with 300s (1) cores
% 0.13/0.41 % Starting sh5l with 300s (1) cores
% 0.13/0.41 % G-E--_302_C18_F1_URBAN_RG_S04BN with pid 1678004 completed with status 0
% 0.13/0.41 % Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.13/0.41 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.13/0.41 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.41 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.13/0.41 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.13/0.41 % No SInE strategy applied
% 0.13/0.41 % Search class: FUUPF-FFSF21-DFFFFFNN
% 0.13/0.41 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.13/0.41 % Starting SubtermCWHack with 136s (1) cores
% 0.13/0.41 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.13/0.41 % Starting U----_116XG_C05_02_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.13/0.41 % Starting new_bool_3 with 136s (1) cores
% 0.13/0.41 % Starting new_bool_1 with 136s (1) cores
% 0.13/0.41 % SubtermCWHack with pid 1678009 completed with status 0
% 0.13/0.41 % Result found by SubtermCWHack
% 0.13/0.41 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.13/0.41 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.41 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.13/0.41 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.13/0.41 % No SInE strategy applied
% 0.13/0.41 % Search class: FUUPF-FFSF21-DFFFFFNN
% 0.13/0.41 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.13/0.41 % Starting SubtermCWHack with 136s (1) cores
% 0.13/0.41 % Preprocessing time : 0.001 s
% 0.13/0.41
% 0.13/0.41 % Proof found!
% 0.13/0.41 % SZS status Unsatisfiable
% 0.13/0.41 % SZS output start CNFRefutation
% See solution above
% 0.13/0.41 % Parsed axioms : 3
% 0.13/0.41 % Removed by relevancy pruning/SinE : 0
% 0.13/0.41 % Initial clauses : 3
% 0.13/0.41 % Removed in clause preprocessing : 1
% 0.13/0.41 % Initial clauses in saturation : 2
% 0.13/0.41 % Processed clauses : 14
% 0.13/0.41 % ...of these trivial : 1
% 0.13/0.41 % ...subsumed : 0
% 0.13/0.41 % ...remaining for further processing : 13
% 0.13/0.41 % Other redundant clauses eliminated : 0
% 0.13/0.41 % Clauses deleted for lack of memory : 0
% 0.13/0.41 % Backward-subsumed : 0
% 0.13/0.41 % Backward-rewritten : 1
% 0.13/0.41 % Generated clauses : 225
% 0.13/0.41 % ...of the previous two non-redundant : 157
% 0.13/0.41 % ...aggressively subsumed : 0
% 0.13/0.41 % Contextual simplify-reflections : 0
% 0.13/0.41 % Paramodulations : 225
% 0.13/0.41 % Factorizations : 0
% 0.13/0.41 % NegExts : 0
% 0.13/0.41 % Equation resolutions : 0
% 0.13/0.41 % Disequality decompositions : 0
% 0.13/0.41 % Total rewrite steps : 33
% 0.13/0.41 % ...of those cached : 14
% 0.13/0.41 % Propositional unsat checks : 0
% 0.13/0.41 % Propositional check models : 0
% 0.13/0.41 % Propositional check unsatisfiable : 0
% 0.13/0.41 % Propositional clauses : 0
% 0.13/0.41 % Propositional clauses after purity: 0
% 0.13/0.41 % Propositional unsat core size : 0
% 0.13/0.41 % Propositional preprocessing time : 0.000
% 0.13/0.41 % Propositional encoding time : 0.000
% 0.13/0.41 % Propositional solver time : 0.000
% 0.13/0.41 % Success case prop preproc time : 0.000
% 0.13/0.41 % Success case prop encoding time : 0.000
% 0.13/0.41 % Success case prop solver time : 0.000
% 0.13/0.41 % Current number of processed clauses : 12
% 0.13/0.41 % Positive orientable unit clauses : 10
% 0.13/0.41 % Positive unorientable unit clauses: 1
% 0.13/0.41 % Negative unit clauses : 1
% 0.13/0.41 % Non-unit-clauses : 0
% 0.13/0.41 % Current number of unprocessed clauses: 145
% 0.13/0.41 % ...number of literals in the above : 145
% 0.13/0.41 % Current number of archived formulas : 0
% 0.13/0.41 % Current number of archived clauses : 2
% 0.13/0.41 % Clause-clause subsumption calls (NU) : 0
% 0.13/0.41 % Rec. Clause-clause subsumption calls : 0
% 0.13/0.41 % Non-unit clause-clause subsumptions : 0
% 0.13/0.41 % Unit Clause-clause subsumption calls : 9
% 0.13/0.41 % Rewrite failures with RHS unbound : 6
% 0.13/0.41 % BW rewrite match attempts : 31
% 0.13/0.41 % BW rewrite match successes : 7
% 0.13/0.41 % Condensation attempts : 0
% 0.13/0.41 % Condensation successes : 0
% 0.13/0.41 % Termbank termtop insertions : 2403
% 0.13/0.41 % Search garbage collected termcells : 2
% 0.13/0.41
% 0.13/0.41 % -------------------------------------------------
% 0.13/0.41 % User time : 0.006 s
% 0.13/0.41 % System time : 0.000 s
% 0.13/0.41 % Total time : 0.006 s
% 0.13/0.41 % Maximum resident set size: 3580 pages
% 0.13/0.41
% 0.13/0.41 % -------------------------------------------------
% 0.13/0.41 % User time : 0.014 s
% 0.13/0.41 % System time : 0.010 s
% 0.13/0.41 % Total time : 0.024 s
% 0.13/0.41 % Maximum resident set size: 4864 pages
% 0.13/0.41 % E exiting
%------------------------------------------------------------------------------