%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : GRP020-1 : TPTP v9.3.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n006.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:37:27 PM UTC 2026
% Result : Unsatisfiable 0.09s 0.44s
% Output : CNFRefutation 0.09s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 4
% Syntax : Number of clauses : 13 ( 9 unt; 0 nHn; 8 RR)
% Number of literals : 20 ( 8 equ; 10 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-3 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 21 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(total_function2,axiom,
( ~ product(X1,X2,X4)
| ~ product(X1,X2,X3)
| X3 = X4 ),
file('/export/starexec/sandbox/benchmark/Axioms/GRP003-0.ax',total_function2) ).
cnf(left_inverse,axiom,
product(inverse(X1),X1,identity),
file('/export/starexec/sandbox/benchmark/Axioms/GRP003-0.ax',left_inverse) ).
cnf(prove_inverse_X_times_X_is_id,negated_conjecture,
multiply(inverse(a),a) != identity,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_inverse_X_times_X_is_id) ).
cnf(total_function1,axiom,
product(X1,X2,multiply(X1,X2)),
file('/export/starexec/sandbox/benchmark/Axioms/GRP003-0.ax',total_function1) ).
cnf(c_0_4,plain,
( ~ product(X1,X2,X4)
| ~ product(X1,X2,X3)
| X3 = X4 ),
inference(fof_simplification,[status(thm)],[total_function2]) ).
cnf(c_0_5,plain,
( ~ product(X1,X2,X4)
| ~ product(X1,X2,X3)
| X3 = X4 ),
c_0_4 ).
cnf(c_0_6,axiom,
product(inverse(X1),X1,identity),
left_inverse ).
cnf(c_0_7,negated_conjecture,
multiply(inverse(a),a) != identity,
inference(fof_simplification,[status(thm)],[prove_inverse_X_times_X_is_id]) ).
cnf(c_0_8,plain,
( ~ product(inverse(X2),X2,X1)
| X1 = identity ),
inference(spm,[status(thm)],[c_0_5,c_0_6]) ).
cnf(c_0_9,axiom,
product(X1,X2,multiply(X1,X2)),
total_function1 ).
cnf(c_0_10,negated_conjecture,
multiply(inverse(a),a) != identity,
c_0_7 ).
cnf(c_0_11,plain,
multiply(inverse(X1),X1) = identity,
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_12,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_10,c_0_11])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GRP020-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.38 % Computer : n006.cluster.edu
% 0.09/0.38 % Model : x86_64 x86_64
% 0.09/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.38 % Memory : 8046.5625MB
% 0.09/0.38 % OS : Linux 6.8.0-71-generic
% 0.09/0.38 % CPULimit : 300
% 0.09/0.38 % WCLimit : 300
% 0.09/0.38 % DateTime : Sun Sep 20 19:54:00 UTC 2026
% 0.09/0.38 % CPUTime :
% 0.09/0.38 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.43 Running first-order theorem proving
% 0.09/0.43 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.09/0.44 % Version: 3.5.1
% 0.09/0.44 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.09/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.09/0.44 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.09/0.44 % Starting new_bool_3 with 300s (1) cores
% 0.09/0.44 % Starting new_bool_1 with 300s (1) cores
% 0.09/0.44 % Starting sh5l with 300s (1) cores
% 0.09/0.44 % new_bool_3 with pid 1125269 completed with status 0
% 0.09/0.44 % Result found by new_bool_3
% 0.09/0.44 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.09/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.09/0.44 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.09/0.44 % Starting new_bool_3 with 300s (1) cores
% 0.09/0.44 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.09/0.44 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.09/0.44 % Search class: FHUSM-FFSF21-SFFFFFNN
% 0.09/0.44 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.09/0.44 % Starting SubtermCWHack with 31s (1) cores
% 0.09/0.44 % SubtermCWHack with pid 1125275 completed with status 0
% 0.09/0.44 % Result found by SubtermCWHack
% 0.09/0.44 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.09/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.09/0.44 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.09/0.44 % Starting new_bool_3 with 300s (1) cores
% 0.09/0.44 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.09/0.44 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.09/0.44 % Search class: FHUSM-FFSF21-SFFFFFNN
% 0.09/0.44 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.09/0.44 % Starting SubtermCWHack with 31s (1) cores
% 0.09/0.44 % Preprocessing time : 0.001 s
% 0.09/0.44
% 0.09/0.44 % Proof found!
% 0.09/0.44 % SZS status Unsatisfiable
% 0.09/0.44 % SZS output start CNFRefutation
% See solution above
% 0.09/0.44 % Parsed axioms : 9
% 0.09/0.44 % Removed by relevancy pruning/SinE : 0
% 0.09/0.44 % Initial clauses : 9
% 0.09/0.44 % Removed in clause preprocessing : 0
% 0.09/0.44 % Initial clauses in saturation : 9
% 0.09/0.44 % Processed clauses : 15
% 0.09/0.44 % ...of these trivial : 0
% 0.09/0.44 % ...subsumed : 0
% 0.09/0.44 % ...remaining for further processing : 15
% 0.09/0.44 % Other redundant clauses eliminated : 0
% 0.09/0.44 % Clauses deleted for lack of memory : 0
% 0.09/0.44 % Backward-subsumed : 0
% 0.09/0.44 % Backward-rewritten : 1
% 0.09/0.44 % Generated clauses : 24
% 0.09/0.44 % ...of the previous two non-redundant : 15
% 0.09/0.44 % ...aggressively subsumed : 0
% 0.09/0.44 % Contextual simplify-reflections : 0
% 0.09/0.44 % Paramodulations : 24
% 0.09/0.44 % Factorizations : 0
% 0.09/0.44 % NegExts : 0
% 0.09/0.44 % Equation resolutions : 0
% 0.09/0.44 % Disequality decompositions : 0
% 0.09/0.44 % Total rewrite steps : 7
% 0.09/0.44 % ...of those cached : 2
% 0.09/0.44 % Propositional unsat checks : 0
% 0.09/0.44 % Propositional check models : 0
% 0.09/0.44 % Propositional check unsatisfiable : 0
% 0.09/0.44 % Propositional clauses : 0
% 0.09/0.44 % Propositional clauses after purity: 0
% 0.09/0.44 % Propositional unsat core size : 0
% 0.09/0.44 % Propositional preprocessing time : 0.000
% 0.09/0.44 % Propositional encoding time : 0.000
% 0.09/0.44 % Propositional solver time : 0.000
% 0.09/0.44 % Success case prop preproc time : 0.000
% 0.09/0.44 % Success case prop encoding time : 0.000
% 0.09/0.44 % Success case prop solver time : 0.000
% 0.09/0.44 % Current number of processed clauses : 14
% 0.09/0.44 % Positive orientable unit clauses : 9
% 0.09/0.44 % Positive unorientable unit clauses: 0
% 0.09/0.44 % Negative unit clauses : 0
% 0.09/0.44 % Non-unit-clauses : 5
% 0.09/0.44 % Current number of unprocessed clauses: 9
% 0.09/0.44 % ...number of literals in the above : 25
% 0.09/0.44 % Current number of archived formulas : 0
% 0.09/0.44 % Current number of archived clauses : 1
% 0.09/0.44 % Clause-clause subsumption calls (NU) : 6
% 0.09/0.44 % Rec. Clause-clause subsumption calls : 5
% 0.09/0.44 % Non-unit clause-clause subsumptions : 0
% 0.09/0.44 % Unit Clause-clause subsumption calls : 0
% 0.09/0.44 % Rewrite failures with RHS unbound : 0
% 0.09/0.44 % BW rewrite match attempts : 5
% 0.09/0.44 % BW rewrite match successes : 1
% 0.09/0.44 % Condensation attempts : 0
% 0.09/0.44 % Condensation successes : 0
% 0.09/0.44 % Termbank termtop insertions : 396
% 0.09/0.44 % Search garbage collected termcells : 18
% 0.09/0.44
% 0.09/0.44 % -------------------------------------------------
% 0.09/0.44 % User time : 0.003 s
% 0.09/0.44 % System time : 0.001 s
% 0.09/0.44 % Total time : 0.004 s
% 0.09/0.44 % Maximum resident set size: 3640 pages
% 0.09/0.44
% 0.09/0.44 % -------------------------------------------------
% 0.09/0.44 % User time : 0.005 s
% 0.09/0.44 % System time : 0.005 s
% 0.09/0.44 % Total time : 0.010 s
% 0.09/0.44 % Maximum resident set size: 4864 pages
% 0.09/0.45 % E exiting
%------------------------------------------------------------------------------