%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : GRP135-2.002 : TPTP v9.3.1. Released v1.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n002.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:38:43 PM UTC 2026
% Result : Unsatisfiable 0.26s 0.53s
% Output : CNFRefutation 0.26s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 8
% Syntax : Number of clauses : 42 ( 15 unt; 16 nHn; 42 RR)
% Number of literals : 90 ( 0 equ; 39 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 2 ( 2 usr; 2 con; 0-0 aty)
% Number of variables : 50 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(product_total_function1,axiom,
( ~ group_element(X2)
| ~ group_element(X1)
| product(X1,X2,e_2)
| product(X1,X2,e_1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',product_total_function1) ).
cnf(element_2,axiom,
group_element(e_2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',element_2) ).
cnf(product_left_cancellation,axiom,
( ~ product(X4,X2,X3)
| ~ product(X1,X2,X3)
| equalish(X1,X4) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',product_left_cancellation) ).
cnf(qg3,negated_conjecture,
( ~ product(X3,X1,X4)
| ~ product(X1,X2,X3)
| product(X4,X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',qg3) ).
cnf(element_1,axiom,
group_element(e_1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',element_1) ).
cnf(e_1_is_not_e_2,axiom,
~ equalish(e_1,e_2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',e_1_is_not_e_2) ).
cnf(e_2_is_not_e_1,axiom,
~ equalish(e_2,e_1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',e_2_is_not_e_1) ).
cnf(product_right_cancellation,axiom,
( ~ product(X1,X4,X3)
| ~ product(X1,X2,X3)
| equalish(X2,X4) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',product_right_cancellation) ).
cnf(c_0_8,plain,
( ~ group_element(X2)
| ~ group_element(X1)
| product(X1,X2,e_2)
| product(X1,X2,e_1) ),
inference(fof_simplification,[status(thm)],[product_total_function1]) ).
cnf(c_0_9,plain,
( ~ group_element(X2)
| ~ group_element(X1)
| product(X1,X2,e_2)
| product(X1,X2,e_1) ),
c_0_8 ).
cnf(c_0_10,axiom,
group_element(e_2),
element_2 ).
cnf(c_0_11,plain,
( ~ product(X4,X2,X3)
| ~ product(X1,X2,X3)
| equalish(X1,X4) ),
inference(fof_simplification,[status(thm)],[product_left_cancellation]) ).
cnf(c_0_12,plain,
( ~ group_element(X1)
| product(X1,e_2,e_1)
| product(X1,e_2,e_2) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_13,negated_conjecture,
( ~ product(X3,X1,X4)
| ~ product(X1,X2,X3)
| product(X4,X1,X2) ),
inference(fof_simplification,[status(thm)],[qg3]) ).
cnf(c_0_14,axiom,
group_element(e_1),
element_1 ).
cnf(c_0_15,plain,
( ~ product(X4,X2,X3)
| ~ product(X1,X2,X3)
| equalish(X1,X4) ),
c_0_11 ).
cnf(c_0_16,plain,
( product(e_2,e_2,e_2)
| product(e_2,e_2,e_1) ),
inference(spm,[status(thm)],[c_0_12,c_0_10]) ).
cnf(c_0_17,plain,
~ equalish(e_1,e_2),
inference(fof_simplification,[status(thm)],[e_1_is_not_e_2]) ).
cnf(c_0_18,negated_conjecture,
( ~ product(X3,X1,X4)
| ~ product(X1,X2,X3)
| product(X4,X1,X2) ),
c_0_13 ).
cnf(c_0_19,plain,
( product(e_1,e_2,e_2)
| product(e_1,e_2,e_1) ),
inference(spm,[status(thm)],[c_0_12,c_0_14]) ).
cnf(c_0_20,plain,
( ~ product(X1,e_2,e_2)
| product(e_2,e_2,e_1)
| equalish(X1,e_2) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_21,plain,
~ equalish(e_1,e_2),
c_0_17 ).
cnf(c_0_22,negated_conjecture,
( ~ product(e_2,X1,e_1)
| product(e_2,e_2,X1)
| product(e_1,e_2,e_1) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_23,plain,
( product(e_2,e_2,e_1)
| product(e_1,e_2,e_1) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_19]),c_0_21]) ).
cnf(c_0_24,plain,
~ equalish(e_2,e_1),
inference(fof_simplification,[status(thm)],[e_2_is_not_e_1]) ).
cnf(c_0_25,plain,
( ~ group_element(X1)
| product(X1,e_1,e_1)
| product(X1,e_1,e_2) ),
inference(spm,[status(thm)],[c_0_9,c_0_14]) ).
cnf(c_0_26,plain,
( ~ product(X1,X4,X3)
| ~ product(X1,X2,X3)
| equalish(X2,X4) ),
inference(fof_simplification,[status(thm)],[product_right_cancellation]) ).
cnf(c_0_27,plain,
( ~ product(X1,e_2,e_2)
| product(e_1,e_2,e_1)
| equalish(X1,e_1) ),
inference(spm,[status(thm)],[c_0_15,c_0_19]) ).
cnf(c_0_28,negated_conjecture,
( product(e_1,e_2,e_1)
| product(e_2,e_2,e_2) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_29,plain,
~ equalish(e_2,e_1),
c_0_24 ).
cnf(c_0_30,plain,
( product(e_2,e_1,e_2)
| product(e_2,e_1,e_1) ),
inference(spm,[status(thm)],[c_0_25,c_0_10]) ).
cnf(c_0_31,plain,
( ~ product(X1,X4,X3)
| ~ product(X1,X2,X3)
| equalish(X2,X4) ),
c_0_26 ).
cnf(c_0_32,negated_conjecture,
product(e_1,e_2,e_1),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_29]) ).
cnf(c_0_33,plain,
( ~ product(X1,e_1,e_2)
| product(e_2,e_1,e_1)
| equalish(X1,e_2) ),
inference(spm,[status(thm)],[c_0_15,c_0_30]) ).
cnf(c_0_34,plain,
( product(e_1,e_1,e_2)
| product(e_1,e_1,e_1) ),
inference(spm,[status(thm)],[c_0_25,c_0_14]) ).
cnf(c_0_35,negated_conjecture,
( ~ product(e_1,X1,e_1)
| equalish(X1,e_2) ),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_36,plain,
( product(e_2,e_1,e_1)
| product(e_1,e_1,e_1) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_21]) ).
cnf(c_0_37,negated_conjecture,
~ product(e_1,e_1,e_1),
inference(spm,[status(thm)],[c_0_21,c_0_35]) ).
cnf(c_0_38,plain,
product(e_2,e_1,e_1),
inference(sr,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_39,negated_conjecture,
( ~ product(e_1,X1,e_2)
| product(e_1,e_1,X1) ),
inference(spm,[status(thm)],[c_0_18,c_0_38]) ).
cnf(c_0_40,plain,
product(e_1,e_1,e_2),
inference(sr,[status(thm)],[c_0_34,c_0_37]) ).
cnf(c_0_41,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_37]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : GRP135-2.002 : TPTP v9.3.1. Released v1.2.0.
% 0.00/0.07 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.19/0.44 % Computer : n002.cluster.edu
% 0.19/0.44 % Model : x86_64 x86_64
% 0.19/0.44 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.19/0.44 % Memory : 8046.5625MB
% 0.19/0.44 % OS : Linux 6.8.0-71-generic
% 0.19/0.44 % CPULimit : 300
% 0.19/0.44 % WCLimit : 300
% 0.19/0.44 % DateTime : Sun Sep 20 20:04:46 UTC 2026
% 0.19/0.45 % CPUTime :
% 0.19/0.45 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.19/0.50 Running first-order theorem proving
% 0.19/0.50 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.26/0.53 % Version: 3.5.1
% 0.26/0.53 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.26/0.53 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.26/0.53 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.26/0.53 % Starting new_bool_3 with 300s (1) cores
% 0.26/0.53 % Starting new_bool_1 with 300s (1) cores
% 0.26/0.53 % Starting sh5l with 300s (1) cores
% 0.26/0.53 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 1584162 completed with status 0
% 0.26/0.53 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.26/0.53 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.26/0.53 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.26/0.53 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.26/0.53 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.26/0.53 % No SInE strategy applied
% 0.26/0.53 % Search class: FGHNF-FFSS00-SFFFFFNN
% 0.26/0.53 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.26/0.53 % Starting SubtermCWHack with 136s (1) cores
% 0.26/0.53 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.26/0.53 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.26/0.53 % Starting new_bool_3 with 136s (1) cores
% 0.26/0.53 % Starting new_bool_1 with 136s (1) cores
% 0.26/0.53 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 1584167 completed with status 0
% 0.26/0.53 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.26/0.53 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.26/0.53 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.26/0.53 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.26/0.53 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.26/0.53 % No SInE strategy applied
% 0.26/0.53 % Search class: FGHNF-FFSS00-SFFFFFNN
% 0.26/0.53 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.26/0.53 % Starting SubtermCWHack with 136s (1) cores
% 0.26/0.53 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.26/0.53 % Preprocessing time : 0.001 s
% 0.26/0.53 % Presaturation interreduction done
% 0.26/0.53
% 0.26/0.53 % Proof found!
% 0.26/0.53 % SZS status Unsatisfiable
% 0.26/0.53 % SZS output start CNFRefutation
% See solution above
% 0.26/0.53 % Parsed axioms : 12
% 0.26/0.53 % Removed by relevancy pruning/SinE : 0
% 0.26/0.53 % Initial clauses : 12
% 0.26/0.53 % Removed in clause preprocessing : 0
% 0.26/0.53 % Initial clauses in saturation : 12
% 0.26/0.53 % Processed clauses : 92
% 0.26/0.53 % ...of these trivial : 0
% 0.26/0.53 % ...subsumed : 14
% 0.26/0.53 % ...remaining for further processing : 78
% 0.26/0.53 % Other redundant clauses eliminated : 0
% 0.26/0.53 % Clauses deleted for lack of memory : 0
% 0.26/0.53 % Backward-subsumed : 8
% 0.26/0.53 % Backward-rewritten : 16
% 0.26/0.53 % Generated clauses : 117
% 0.26/0.53 % ...of the previous two non-redundant : 109
% 0.26/0.53 % ...aggressively subsumed : 0
% 0.26/0.53 % Contextual simplify-reflections : 0
% 0.26/0.53 % Paramodulations : 112
% 0.26/0.53 % Factorizations : 0
% 0.26/0.53 % NegExts : 0
% 0.26/0.53 % Equation resolutions : 0
% 0.26/0.53 % Disequality decompositions : 0
% 0.26/0.53 % Total rewrite steps : 23
% 0.26/0.53 % ...of those cached : 18
% 0.26/0.53 % Propositional unsat checks : 0
% 0.26/0.53 % Propositional check models : 0
% 0.26/0.53 % Propositional check unsatisfiable : 0
% 0.26/0.53 % Propositional clauses : 0
% 0.26/0.53 % Propositional clauses after purity: 0
% 0.26/0.53 % Propositional unsat core size : 0
% 0.26/0.53 % Propositional preprocessing time : 0.000
% 0.26/0.53 % Propositional encoding time : 0.000
% 0.26/0.53 % Propositional solver time : 0.000
% 0.26/0.53 % Success case prop preproc time : 0.000
% 0.26/0.53 % Success case prop encoding time : 0.000
% 0.26/0.53 % Success case prop solver time : 0.000
% 0.26/0.53 % Current number of processed clauses : 37
% 0.26/0.53 % Positive orientable unit clauses : 10
% 0.26/0.53 % Positive unorientable unit clauses: 0
% 0.26/0.53 % Negative unit clauses : 6
% 0.26/0.53 % Non-unit-clauses : 21
% 0.26/0.53 % Current number of unprocessed clauses: 10
% 0.26/0.53 % ...number of literals in the above : 20
% 0.26/0.53 % Current number of archived formulas : 0
% 0.26/0.53 % Current number of archived clauses : 41
% 0.26/0.53 % Clause-clause subsumption calls (NU) : 176
% 0.26/0.53 % Rec. Clause-clause subsumption calls : 129
% 0.26/0.53 % Non-unit clause-clause subsumptions : 16
% 0.26/0.53 % Unit Clause-clause subsumption calls : 48
% 0.26/0.53 % Rewrite failures with RHS unbound : 0
% 0.26/0.53 % BW rewrite match attempts : 12
% 0.26/0.53 % BW rewrite match successes : 4
% 0.26/0.53 % Condensation attempts : 0
% 0.26/0.53 % Condensation successes : 0
% 0.26/0.53 % Termbank termtop insertions : 1796
% 0.26/0.53 % Search garbage collected termcells : 36
% 0.26/0.53
% 0.26/0.53 % -------------------------------------------------
% 0.26/0.53 % User time : 0.008 s
% 0.26/0.53 % System time : 0.002 s
% 0.26/0.53 % Total time : 0.010 s
% 0.26/0.53 % Maximum resident set size: 3636 pages
% 0.26/0.53
% 0.26/0.53 % -------------------------------------------------
% 0.26/0.53 % User time : 0.024 s
% 0.26/0.53 % System time : 0.016 s
% 0.26/0.53 % Total time : 0.040 s
% 0.26/0.53 % Maximum resident set size: 4864 pages
% 0.26/0.53 % E exiting
%------------------------------------------------------------------------------