%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : GRP040-3 : TPTP v9.3.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n017.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:33 PM UTC 2026
% Result : Unsatisfiable 0.31s 0.46s
% Output : CNFRefutation 0.31s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 15
% Syntax : Number of clauses : 63 ( 34 unt; 4 nHn; 46 RR)
% Number of literals : 118 ( 17 equ; 54 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 8 ( 8 usr; 5 con; 0-2 aty)
% Number of variables : 93 ( 1 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(associativity1,axiom,
( ~ product(X3,X4,X6)
| ~ product(X2,X4,X5)
| ~ product(X1,X2,X3)
| product(X1,X5,X6) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GRP003-0.ax',associativity1) ).
cnf(left_identity,axiom,
product(identity,X1,X1),
file('/export/starexec/sandbox2/benchmark/Axioms/GRP003-0.ax',left_identity) ).
cnf(total_function2,axiom,
( ~ product(X1,X2,X4)
| ~ product(X1,X2,X3)
| X3 = X4 ),
file('/export/starexec/sandbox2/benchmark/Axioms/GRP003-0.ax',total_function2) ).
cnf(right_inverse,axiom,
product(X1,inverse(X1),identity),
file('/export/starexec/sandbox2/benchmark/Axioms/GRP003-0.ax',right_inverse) ).
cnf(closure_of_product_and_inverse,axiom,
( ~ product(X1,inverse(X2),X3)
| ~ subgroup_member(X2)
| ~ subgroup_member(X1)
| subgroup_member(X3) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GRP003-2.ax',closure_of_product_and_inverse) ).
cnf(total_function1,axiom,
product(X1,X2,multiply(X1,X2)),
file('/export/starexec/sandbox2/benchmark/Axioms/GRP003-0.ax',total_function1) ).
cnf(left_inverse,axiom,
product(inverse(X1),X1,identity),
file('/export/starexec/sandbox2/benchmark/Axioms/GRP003-0.ax',left_inverse) ).
cnf(prove_inverse_is_self_cancelling,negated_conjecture,
inverse(inverse(X1)) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_inverse_is_self_cancelling) ).
cnf(a_times_c_is_d,hypothesis,
product(a,c,d),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a_times_c_is_d) ).
cnf(b_is_in_subgroup,hypothesis,
subgroup_member(b),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',b_is_in_subgroup) ).
cnf(b_times_a_inverse_is_c,hypothesis,
product(b,inverse(a),c),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',b_times_a_inverse_is_c) ).
cnf(d_in_subgroup,hypothesis,
~ subgroup_member(d),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d_in_subgroup) ).
cnf(a_in_subgroup,hypothesis,
~ subgroup_member(a),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a_in_subgroup) ).
cnf(property_of_O2,axiom,
( subgroup_member(X1)
| subgroup_member(X2)
| product(X1,element_in_O2(X1,X2),X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',property_of_O2) ).
cnf(an_element_in_O2,axiom,
( subgroup_member(X1)
| subgroup_member(X2)
| subgroup_member(element_in_O2(X1,X2)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',an_element_in_O2) ).
cnf(c_0_15,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_16,plain,
( ~ product(X3,X4,X6)
| ~ product(X2,X4,X5)
| ~ product(X1,X2,X3)
| product(X1,X5,X6) ),
c_0_15 ).
cnf(c_0_17,axiom,
product(identity,X1,X1),
left_identity ).
cnf(c_0_18,plain,
( ~ product(X1,X2,X4)
| ~ product(X1,X2,X3)
| X3 = X4 ),
inference(fof_simplification,[status(thm)],[total_function2]) ).
cnf(c_0_19,plain,
( ~ product(X4,X3,X2)
| ~ product(X1,X4,identity)
| product(X1,X2,X3) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_20,axiom,
product(X1,inverse(X1),identity),
right_inverse ).
cnf(c_0_21,plain,
( ~ product(X1,inverse(X2),X3)
| ~ subgroup_member(X2)
| ~ subgroup_member(X1)
| subgroup_member(X3) ),
inference(fof_simplification,[status(thm)],[closure_of_product_and_inverse]) ).
cnf(c_0_22,plain,
( ~ product(X1,X2,X4)
| ~ product(X1,X2,X3)
| X3 = X4 ),
c_0_18 ).
cnf(c_0_23,axiom,
product(X1,X2,multiply(X1,X2)),
total_function1 ).
cnf(c_0_24,plain,
( ~ product(inverse(X1),X3,X2)
| product(X1,X2,X3) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_25,plain,
( ~ product(X1,inverse(X2),X3)
| ~ subgroup_member(X2)
| ~ subgroup_member(X1)
| subgroup_member(X3) ),
c_0_21 ).
cnf(c_0_26,axiom,
product(inverse(X1),X1,identity),
left_inverse ).
cnf(c_0_27,negated_conjecture,
inverse(inverse(X1)) = X1,
prove_inverse_is_self_cancelling ).
cnf(c_0_28,plain,
( ~ product(X2,X3,X1)
| X1 = multiply(X2,X3) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_29,plain,
product(X1,multiply(inverse(X1),X2),X2),
inference(spm,[status(thm)],[c_0_24,c_0_23]) ).
cnf(c_0_30,hypothesis,
product(a,c,d),
a_times_c_is_d ).
cnf(c_0_31,plain,
( ~ subgroup_member(X1)
| subgroup_member(identity) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_27])]) ).
cnf(c_0_32,hypothesis,
subgroup_member(b),
b_is_in_subgroup ).
cnf(c_0_33,plain,
multiply(X1,multiply(inverse(X1),X2)) = X2,
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_34,hypothesis,
( ~ product(a,c,X1)
| X1 = d ),
inference(spm,[status(thm)],[c_0_22,c_0_30]) ).
cnf(c_0_35,hypothesis,
subgroup_member(identity),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_36,hypothesis,
product(b,inverse(a),c),
b_times_a_inverse_is_c ).
cnf(c_0_37,negated_conjecture,
multiply(inverse(X1),multiply(X1,X2)) = X2,
inference(spm,[status(thm)],[c_0_33,c_0_27]) ).
cnf(c_0_38,hypothesis,
multiply(a,c) = d,
inference(spm,[status(thm)],[c_0_34,c_0_23]) ).
cnf(c_0_39,negated_conjecture,
( ~ product(X3,X2,X1)
| ~ subgroup_member(X3)
| ~ subgroup_member(inverse(X2))
| subgroup_member(X1) ),
inference(spm,[status(thm)],[c_0_25,c_0_27]) ).
cnf(c_0_40,plain,
( ~ subgroup_member(X1)
| subgroup_member(inverse(X1)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_17]),c_0_35])]) ).
cnf(c_0_41,hypothesis,
( ~ product(b,inverse(a),X1)
| X1 = c ),
inference(spm,[status(thm)],[c_0_22,c_0_36]) ).
cnf(c_0_42,hypothesis,
multiply(inverse(a),d) = c,
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_43,negated_conjecture,
( ~ product(X2,X3,X1)
| ~ subgroup_member(X3)
| ~ subgroup_member(X2)
| subgroup_member(X1) ),
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_44,hypothesis,
multiply(b,inverse(a)) = c,
inference(spm,[status(thm)],[c_0_41,c_0_23]) ).
cnf(c_0_45,hypothesis,
product(inverse(a),d,c),
inference(spm,[status(thm)],[c_0_23,c_0_42]) ).
cnf(c_0_46,negated_conjecture,
( ~ subgroup_member(X2)
| ~ subgroup_member(X1)
| subgroup_member(multiply(X1,X2)) ),
inference(spm,[status(thm)],[c_0_43,c_0_23]) ).
cnf(c_0_47,hypothesis,
multiply(inverse(b),c) = inverse(a),
inference(spm,[status(thm)],[c_0_37,c_0_44]) ).
cnf(c_0_48,hypothesis,
( ~ product(inverse(a),d,X1)
| X1 = c ),
inference(spm,[status(thm)],[c_0_22,c_0_45]) ).
cnf(c_0_49,plain,
( ~ product(X1,X3,X2)
| product(inverse(X1),X2,X3) ),
inference(spm,[status(thm)],[c_0_19,c_0_26]) ).
cnf(c_0_50,hypothesis,
~ subgroup_member(d),
inference(fof_simplification,[status(thm)],[d_in_subgroup]) ).
cnf(c_0_51,hypothesis,
~ subgroup_member(a),
inference(fof_simplification,[status(thm)],[a_in_subgroup]) ).
cnf(c_0_52,negated_conjecture,
( ~ subgroup_member(c)
| ~ subgroup_member(inverse(b))
| subgroup_member(inverse(a)) ),
inference(spm,[status(thm)],[c_0_46,c_0_47]) ).
cnf(c_0_53,hypothesis,
( ~ product(a,X1,d)
| X1 = c ),
inference(spm,[status(thm)],[c_0_48,c_0_49]) ).
cnf(c_0_54,axiom,
( subgroup_member(X1)
| subgroup_member(X2)
| product(X1,element_in_O2(X1,X2),X2) ),
property_of_O2 ).
cnf(c_0_55,hypothesis,
~ subgroup_member(d),
c_0_50 ).
cnf(c_0_56,hypothesis,
~ subgroup_member(a),
c_0_51 ).
cnf(c_0_57,negated_conjecture,
( ~ subgroup_member(inverse(X1))
| subgroup_member(X1) ),
inference(spm,[status(thm)],[c_0_40,c_0_27]) ).
cnf(c_0_58,negated_conjecture,
( ~ subgroup_member(c)
| subgroup_member(inverse(a)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_40]),c_0_32])]) ).
cnf(c_0_59,axiom,
( subgroup_member(X1)
| subgroup_member(X2)
| subgroup_member(element_in_O2(X1,X2)) ),
an_element_in_O2 ).
cnf(c_0_60,hypothesis,
element_in_O2(a,d) = c,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_54]),c_0_55]),c_0_56]) ).
cnf(c_0_61,negated_conjecture,
~ subgroup_member(c),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_58]),c_0_56]) ).
cnf(c_0_62,hypothesis,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_59,c_0_60]),c_0_61]),c_0_55]),c_0_56]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GRP040-3 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.37 % Computer : n017.cluster.edu
% 0.11/0.37 % Model : x86_64 x86_64
% 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37 % Memory : 8046.5625MB
% 0.11/0.37 % OS : Linux 6.8.0-71-generic
% 0.11/0.37 % CPULimit : 300
% 0.11/0.37 % WCLimit : 300
% 0.11/0.37 % DateTime : Sun Sep 20 19:50:56 UTC 2026
% 0.11/0.38 % CPUTime :
% 0.11/0.38 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.14/0.42 Running first-order theorem proving
% 0.14/0.42 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.31/0.46 % Version: 3.5.1
% 0.31/0.46 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.31/0.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.31/0.46 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.31/0.46 % Starting new_bool_3 with 300s (1) cores
% 0.31/0.46 % Starting new_bool_1 with 300s (1) cores
% 0.31/0.46 % Starting sh5l with 300s (1) cores
% 0.31/0.46 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 484538 completed with status 0
% 0.31/0.46 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.31/0.46 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.31/0.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.31/0.46 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.31/0.46 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.31/0.46 % No SInE strategy applied
% 0.31/0.46 % Search class: FGUSM-FFSS21-SFFFFFNN
% 0.31/0.46 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.31/0.46 % Starting SubtermCWHack with 136s (1) cores
% 0.31/0.46 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.31/0.46 % Starting G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_S04BN with 136s (1) cores
% 0.31/0.46 % Starting new_bool_3 with 136s (1) cores
% 0.31/0.46 % Starting new_bool_1 with 136s (1) cores
% 0.31/0.46 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 484545 completed with status 0
% 0.31/0.46 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.31/0.46 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.31/0.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.31/0.46 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.31/0.46 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.31/0.46 % No SInE strategy applied
% 0.31/0.46 % Search class: FGUSM-FFSS21-SFFFFFNN
% 0.31/0.46 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.31/0.46 % Starting SubtermCWHack with 136s (1) cores
% 0.31/0.46 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.31/0.46 % Preprocessing time : 0.001 s
% 0.31/0.46 % Presaturation interreduction done
% 0.31/0.46
% 0.31/0.46 % Proof found!
% 0.31/0.46 % SZS status Unsatisfiable
% 0.31/0.46 % SZS output start CNFRefutation
% See solution above
% 0.31/0.46 % Parsed axioms : 17
% 0.31/0.46 % Removed by relevancy pruning/SinE : 0
% 0.31/0.46 % Initial clauses : 17
% 0.31/0.46 % Removed in clause preprocessing : 0
% 0.31/0.46 % Initial clauses in saturation : 17
% 0.31/0.46 % Processed clauses : 309
% 0.31/0.46 % ...of these trivial : 8
% 0.31/0.46 % ...subsumed : 140
% 0.31/0.46 % ...remaining for further processing : 161
% 0.31/0.46 % Other redundant clauses eliminated : 0
% 0.31/0.46 % Clauses deleted for lack of memory : 0
% 0.31/0.46 % Backward-subsumed : 8
% 0.31/0.46 % Backward-rewritten : 2
% 0.31/0.46 % Generated clauses : 834
% 0.31/0.46 % ...of the previous two non-redundant : 606
% 0.31/0.46 % ...aggressively subsumed : 0
% 0.31/0.46 % Contextual simplify-reflections : 0
% 0.31/0.46 % Paramodulations : 834
% 0.31/0.46 % Factorizations : 0
% 0.31/0.46 % NegExts : 0
% 0.31/0.46 % Equation resolutions : 0
% 0.31/0.46 % Disequality decompositions : 0
% 0.31/0.46 % Total rewrite steps : 358
% 0.31/0.46 % ...of those cached : 303
% 0.31/0.46 % Propositional unsat checks : 0
% 0.31/0.46 % Propositional check models : 0
% 0.31/0.46 % Propositional check unsatisfiable : 0
% 0.31/0.46 % Propositional clauses : 0
% 0.31/0.46 % Propositional clauses after purity: 0
% 0.31/0.46 % Propositional unsat core size : 0
% 0.31/0.46 % Propositional preprocessing time : 0.000
% 0.31/0.46 % Propositional encoding time : 0.000
% 0.31/0.46 % Propositional solver time : 0.000
% 0.31/0.46 % Success case prop preproc time : 0.000
% 0.31/0.46 % Success case prop encoding time : 0.000
% 0.31/0.46 % Success case prop solver time : 0.000
% 0.31/0.46 % Current number of processed clauses : 134
% 0.31/0.46 % Positive orientable unit clauses : 30
% 0.31/0.46 % Positive unorientable unit clauses: 0
% 0.31/0.46 % Negative unit clauses : 5
% 0.31/0.46 % Non-unit-clauses : 99
% 0.31/0.46 % Current number of unprocessed clauses: 327
% 0.31/0.46 % ...number of literals in the above : 923
% 0.31/0.46 % Current number of archived formulas : 0
% 0.31/0.46 % Current number of archived clauses : 27
% 0.31/0.46 % Clause-clause subsumption calls (NU) : 1290
% 0.31/0.46 % Rec. Clause-clause subsumption calls : 1149
% 0.31/0.46 % Non-unit clause-clause subsumptions : 90
% 0.31/0.46 % Unit Clause-clause subsumption calls : 39
% 0.31/0.46 % Rewrite failures with RHS unbound : 0
% 0.31/0.46 % BW rewrite match attempts : 19
% 0.31/0.46 % BW rewrite match successes : 2
% 0.31/0.46 % Condensation attempts : 0
% 0.31/0.46 % Condensation successes : 0
% 0.31/0.46 % Termbank termtop insertions : 8148
% 0.31/0.46 % Search garbage collected termcells : 27
% 0.31/0.46
% 0.31/0.46 % -------------------------------------------------
% 0.31/0.46 % User time : 0.013 s
% 0.31/0.46 % System time : 0.002 s
% 0.31/0.46 % Total time : 0.015 s
% 0.31/0.46 % Maximum resident set size: 3644 pages
% 0.31/0.46
% 0.31/0.46 % -------------------------------------------------
% 0.31/0.46 % User time : 0.062 s
% 0.31/0.46 % System time : 0.015 s
% 0.31/0.46 % Total time : 0.077 s
% 0.31/0.46 % Maximum resident set size: 4864 pages
% 0.31/0.46 % E exiting
%------------------------------------------------------------------------------