%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : GRP048-2 : 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 : 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:37:34 PM UTC 2026
% Result : Unsatisfiable 0.14s 0.45s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 8
% Syntax : Number of clauses : 45 ( 22 unt; 0 nHn; 38 RR)
% Number of literals : 88 ( 0 equ; 46 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-1 aty)
% Number of variables : 91 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(product_substitution3,axiom,
( ~ product(X3,X4,X1)
| ~ equalish(X1,X2)
| product(X3,X4,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/GRP005-0.ax',product_substitution3) ).
cnf(total_function2,axiom,
( ~ product(X1,X2,X4)
| ~ product(X1,X2,X3)
| equalish(X3,X4) ),
file('/export/starexec/sandbox/benchmark/Axioms/GRP005-0.ax',total_function2) ).
cnf(a_equals_b,hypothesis,
equalish(a,b),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',a_equals_b) ).
cnf(associativity1,axiom,
( ~ product(X3,X4,X6)
| ~ product(X2,X4,X5)
| ~ product(X1,X2,X3)
| product(X1,X5,X6) ),
file('/export/starexec/sandbox/benchmark/Axioms/GRP005-0.ax',associativity1) ).
cnf(left_identity,axiom,
product(identity,X1,X1),
file('/export/starexec/sandbox/benchmark/Axioms/GRP005-0.ax',left_identity) ).
cnf(associativity2,axiom,
( ~ product(X1,X5,X6)
| ~ product(X2,X4,X5)
| ~ product(X1,X2,X3)
| product(X3,X4,X6) ),
file('/export/starexec/sandbox/benchmark/Axioms/GRP005-0.ax',associativity2) ).
cnf(left_inverse,axiom,
product(inverse(X1),X1,identity),
file('/export/starexec/sandbox/benchmark/Axioms/GRP005-0.ax',left_inverse) ).
cnf(prove_inverse_substitution,negated_conjecture,
~ equalish(inverse(a),inverse(b)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_inverse_substitution) ).
cnf(c_0_8,plain,
( ~ product(X3,X4,X1)
| ~ equalish(X1,X2)
| product(X3,X4,X2) ),
inference(fof_simplification,[status(thm)],[product_substitution3]) ).
cnf(c_0_9,plain,
( ~ product(X1,X2,X4)
| ~ product(X1,X2,X3)
| equalish(X3,X4) ),
inference(fof_simplification,[status(thm)],[total_function2]) ).
cnf(c_0_10,plain,
( ~ product(X3,X4,X1)
| ~ equalish(X1,X2)
| product(X3,X4,X2) ),
c_0_8 ).
cnf(c_0_11,hypothesis,
equalish(a,b),
a_equals_b ).
cnf(c_0_12,plain,
( ~ product(X3,X4,X6)
| ~ product(X2,X4,X5)
| ~ product(X1,X2,X3)
| product(X1,X5,X6) ),
inference(fof_simplification,[status(thm)],[associativity1]) ).
cnf(c_0_13,plain,
( ~ product(X1,X2,X4)
| ~ product(X1,X2,X3)
| equalish(X3,X4) ),
c_0_9 ).
cnf(c_0_14,axiom,
product(identity,X1,X1),
left_identity ).
cnf(c_0_15,hypothesis,
( ~ product(X1,X2,a)
| product(X1,X2,b) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_16,plain,
( ~ product(X3,X4,X6)
| ~ product(X2,X4,X5)
| ~ product(X1,X2,X3)
| product(X1,X5,X6) ),
c_0_12 ).
cnf(c_0_17,plain,
( ~ product(X1,X5,X6)
| ~ product(X2,X4,X5)
| ~ product(X1,X2,X3)
| product(X3,X4,X6) ),
inference(fof_simplification,[status(thm)],[associativity2]) ).
cnf(c_0_18,plain,
( ~ product(identity,X2,X1)
| equalish(X1,X2) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_19,hypothesis,
product(identity,a,b),
inference(spm,[status(thm)],[c_0_15,c_0_14]) ).
cnf(c_0_20,plain,
( ~ product(X4,X3,X2)
| ~ product(X1,X4,identity)
| product(X1,X2,X3) ),
inference(spm,[status(thm)],[c_0_16,c_0_14]) ).
cnf(c_0_21,axiom,
product(inverse(X1),X1,identity),
left_inverse ).
cnf(c_0_22,plain,
( ~ product(X1,X5,X6)
| ~ product(X2,X4,X5)
| ~ product(X1,X2,X3)
| product(X3,X4,X6) ),
c_0_17 ).
cnf(c_0_23,hypothesis,
equalish(b,a),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_24,plain,
( ~ product(X1,inverse(X2),identity)
| product(X1,identity,X2) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_25,plain,
( ~ product(X4,X2,X3)
| ~ product(X4,identity,X1)
| product(X1,X2,X3) ),
inference(spm,[status(thm)],[c_0_22,c_0_14]) ).
cnf(c_0_26,hypothesis,
( ~ product(X1,X2,b)
| product(X1,X2,a) ),
inference(spm,[status(thm)],[c_0_10,c_0_23]) ).
cnf(c_0_27,plain,
product(inverse(inverse(X1)),identity,X1),
inference(spm,[status(thm)],[c_0_24,c_0_21]) ).
cnf(c_0_28,plain,
( ~ product(inverse(X2),identity,X1)
| product(X1,X2,identity) ),
inference(spm,[status(thm)],[c_0_25,c_0_21]) ).
cnf(c_0_29,hypothesis,
product(inverse(inverse(b)),identity,a),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_30,hypothesis,
product(a,inverse(b),identity),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_31,hypothesis,
product(a,identity,b),
inference(spm,[status(thm)],[c_0_24,c_0_30]) ).
cnf(c_0_32,hypothesis,
( ~ product(a,identity,X1)
| product(X1,identity,b) ),
inference(spm,[status(thm)],[c_0_25,c_0_31]) ).
cnf(c_0_33,hypothesis,
product(b,identity,b),
inference(spm,[status(thm)],[c_0_32,c_0_31]) ).
cnf(c_0_34,hypothesis,
product(b,identity,a),
inference(spm,[status(thm)],[c_0_26,c_0_33]) ).
cnf(c_0_35,plain,
product(X1,inverse(X1),identity),
inference(spm,[status(thm)],[c_0_28,c_0_27]) ).
cnf(c_0_36,hypothesis,
( ~ product(X1,b,identity)
| product(X1,a,identity) ),
inference(spm,[status(thm)],[c_0_20,c_0_34]) ).
cnf(c_0_37,plain,
product(X1,identity,X1),
inference(spm,[status(thm)],[c_0_24,c_0_35]) ).
cnf(c_0_38,plain,
( ~ product(X1,X2,identity)
| product(X1,identity,inverse(X2)) ),
inference(spm,[status(thm)],[c_0_20,c_0_35]) ).
cnf(c_0_39,hypothesis,
product(inverse(b),a,identity),
inference(spm,[status(thm)],[c_0_36,c_0_21]) ).
cnf(c_0_40,negated_conjecture,
~ equalish(inverse(a),inverse(b)),
inference(fof_simplification,[status(thm)],[prove_inverse_substitution]) ).
cnf(c_0_41,plain,
( ~ product(X2,identity,X1)
| equalish(X1,X2) ),
inference(spm,[status(thm)],[c_0_13,c_0_37]) ).
cnf(c_0_42,hypothesis,
product(inverse(b),identity,inverse(a)),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_43,negated_conjecture,
~ equalish(inverse(a),inverse(b)),
c_0_40 ).
cnf(c_0_44,hypothesis,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_42]),c_0_43]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GRP048-2 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.36 % Computer : n015.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.36 % CPULimit : 300
% 0.10/0.36 % WCLimit : 300
% 0.10/0.36 % DateTime : Sun Sep 20 19:59:05 UTC 2026
% 0.10/0.36 % CPUTime :
% 0.10/0.36 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.14/0.41 Running first-order theorem proving
% 0.14/0.41 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.14/0.45 % Version: 3.5.1
% 0.14/0.45 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.45 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/0.45 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.45 % Starting new_bool_1 with 300s (1) cores
% 0.14/0.45 % Starting sh5l with 300s (1) cores
% 0.14/0.45 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 3795154 completed with status 0
% 0.14/0.45 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.14/0.45 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.45 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/0.45 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.14/0.45 % No SInE strategy applied
% 0.14/0.45 % Search class: FHUNS-FFSF21-SFFFFFNN
% 0.14/0.45 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.14/0.45 % Starting SubtermCWHack with 136s (1) cores
% 0.14/0.45 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.14/0.45 % Starting G-E--_107_C18_F1_AE_Q4_CS_SP_S0Y with 136s (1) cores
% 0.14/0.45 % Starting new_bool_3 with 136s (1) cores
% 0.14/0.45 % Starting new_bool_1 with 136s (1) cores
% 0.14/0.45 % new_bool_3 with pid 3795163 completed with status 0
% 0.14/0.45 % Result found by new_bool_3
% 0.14/0.45 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.45 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/0.45 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.14/0.45 % No SInE strategy applied
% 0.14/0.45 % Search class: FHUNS-FFSF21-SFFFFFNN
% 0.14/0.45 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.14/0.45 % Starting SubtermCWHack with 136s (1) cores
% 0.14/0.45 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.14/0.45 % Starting G-E--_107_C18_F1_AE_Q4_CS_SP_S0Y with 136s (1) cores
% 0.14/0.45 % Starting new_bool_3 with 136s (1) cores
% 0.14/0.45 % Preprocessing time : 0.001 s
% 0.14/0.45 % Presaturation interreduction done
% 0.14/0.45
% 0.14/0.45 % Proof found!
% 0.14/0.45 % SZS status Unsatisfiable
% 0.14/0.45 % SZS output start CNFRefutation
% See solution above
% 0.14/0.45 % Parsed axioms : 9
% 0.14/0.45 % Removed by relevancy pruning/SinE : 0
% 0.14/0.45 % Initial clauses : 9
% 0.14/0.45 % Removed in clause preprocessing : 0
% 0.14/0.45 % Initial clauses in saturation : 9
% 0.14/0.45 % Processed clauses : 210
% 0.14/0.45 % ...of these trivial : 5
% 0.14/0.45 % ...subsumed : 9
% 0.14/0.45 % ...remaining for further processing : 196
% 0.14/0.45 % Other redundant clauses eliminated : 0
% 0.14/0.45 % Clauses deleted for lack of memory : 0
% 0.14/0.45 % Backward-subsumed : 6
% 0.14/0.45 % Backward-rewritten : 9
% 0.14/0.45 % Generated clauses : 972
% 0.14/0.45 % ...of the previous two non-redundant : 737
% 0.14/0.45 % ...aggressively subsumed : 0
% 0.14/0.45 % Contextual simplify-reflections : 0
% 0.14/0.45 % Paramodulations : 972
% 0.14/0.45 % Factorizations : 0
% 0.14/0.45 % NegExts : 0
% 0.14/0.45 % Equation resolutions : 0
% 0.14/0.45 % Disequality decompositions : 0
% 0.14/0.45 % Total rewrite steps : 242
% 0.14/0.45 % ...of those cached : 165
% 0.14/0.45 % Propositional unsat checks : 0
% 0.14/0.45 % Propositional check models : 0
% 0.14/0.45 % Propositional check unsatisfiable : 0
% 0.14/0.45 % Propositional clauses : 0
% 0.14/0.45 % Propositional clauses after purity: 0
% 0.14/0.45 % Propositional unsat core size : 0
% 0.14/0.45 % Propositional preprocessing time : 0.000
% 0.14/0.45 % Propositional encoding time : 0.000
% 0.14/0.45 % Propositional solver time : 0.000
% 0.14/0.45 % Success case prop preproc time : 0.000
% 0.14/0.45 % Success case prop encoding time : 0.000
% 0.14/0.45 % Success case prop solver time : 0.000
% 0.14/0.45 % Current number of processed clauses : 172
% 0.14/0.45 % Positive orientable unit clauses : 91
% 0.14/0.45 % Positive unorientable unit clauses: 0
% 0.14/0.45 % Negative unit clauses : 1
% 0.14/0.45 % Non-unit-clauses : 80
% 0.14/0.45 % Current number of unprocessed clauses: 529
% 0.14/0.45 % ...number of literals in the above : 947
% 0.14/0.45 % Current number of archived formulas : 0
% 0.14/0.45 % Current number of archived clauses : 24
% 0.14/0.45 % Clause-clause subsumption calls (NU) : 816
% 0.14/0.45 % Rec. Clause-clause subsumption calls : 747
% 0.14/0.45 % Non-unit clause-clause subsumptions : 15
% 0.14/0.45 % Unit Clause-clause subsumption calls : 14
% 0.14/0.45 % Rewrite failures with RHS unbound : 0
% 0.14/0.45 % BW rewrite match attempts : 89
% 0.14/0.45 % BW rewrite match successes : 9
% 0.14/0.45 % Condensation attempts : 0
% 0.14/0.45 % Condensation successes : 0
% 0.14/0.45 % Termbank termtop insertions : 10356
% 0.14/0.45 % Search garbage collected termcells : 24
% 0.14/0.45
% 0.14/0.45 % -------------------------------------------------
% 0.14/0.45 % User time : 0.018 s
% 0.14/0.45 % System time : 0.005 s
% 0.14/0.45 % Total time : 0.023 s
% 0.14/0.45 % Maximum resident set size: 3640 pages
% 0.14/0.45
% 0.14/0.45 % -------------------------------------------------
% 0.14/0.45 % User time : 0.101 s
% 0.14/0.45 % System time : 0.014 s
% 0.14/0.45 % Total time : 0.115 s
% 0.14/0.45 % Maximum resident set size: 4864 pages
% 0.14/0.45 % E exiting
%------------------------------------------------------------------------------