%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : GRP039-7 : TPTP v9.3.1. Bugfixed v1.0.1.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n018.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:41:27 PM UTC 2026
% Result : Unsatisfiable 0.13s 0.41s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 14
% Syntax : Number of clauses : 47 ( 32 unt; 5 nHn; 28 RR)
% Number of literals : 75 ( 29 equ; 25 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 5 con; 0-2 aty)
% Number of variables : 46 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(associativity,axiom,
multiply(multiply(X1,X2),X3) = multiply(X1,multiply(X2,X3)),
file('/export/starexec/sandbox2/benchmark/Axioms/GRP004-0.ax',associativity) ).
cnf(left_inverse,axiom,
multiply(inverse(X1),X1) = identity,
file('/export/starexec/sandbox2/benchmark/Axioms/GRP004-0.ax',left_inverse) ).
cnf(left_identity,axiom,
multiply(identity,X1) = X1,
file('/export/starexec/sandbox2/benchmark/Axioms/GRP004-0.ax',left_identity) ).
cnf(closure_of_multiply,axiom,
( multiply(X1,X2) != X3
| ~ subgroup_member(X2)
| ~ subgroup_member(X1)
| subgroup_member(X3) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GRP004-1.ax',closure_of_multiply) ).
cnf(right_inverse,axiom,
multiply(X1,inverse(X1)) = identity,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',right_inverse) ).
cnf(b_times_a_inverse_is_c,negated_conjecture,
multiply(b,inverse(a)) = c,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',b_times_a_inverse_is_c) ).
cnf(prove_d_in_O2,negated_conjecture,
~ subgroup_member(d),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_d_in_O2) ).
cnf(inverse_inverse,axiom,
inverse(inverse(X1)) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',inverse_inverse) ).
cnf(b_in_O2,negated_conjecture,
subgroup_member(b),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',b_in_O2) ).
cnf(closure_of_inverse,axiom,
( ~ subgroup_member(X1)
| subgroup_member(inverse(X1)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/GRP004-1.ax',closure_of_inverse) ).
cnf(a_times_c_is_d,negated_conjecture,
multiply(a,c) = d,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a_times_c_is_d) ).
cnf(right_identity,axiom,
multiply(X1,identity) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',right_identity) ).
cnf(property_of_O2,axiom,
( multiply(X1,element_in_O2(X1,X2)) = X2
| subgroup_member(X2)
| subgroup_member(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',property_of_O2) ).
cnf(an_element_in_O2,axiom,
( subgroup_member(element_in_O2(X1,X2))
| subgroup_member(X2)
| subgroup_member(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',an_element_in_O2) ).
cnf(c_0_14,axiom,
multiply(multiply(X1,X2),X3) = multiply(X1,multiply(X2,X3)),
associativity ).
cnf(c_0_15,axiom,
multiply(inverse(X1),X1) = identity,
left_inverse ).
cnf(c_0_16,axiom,
multiply(identity,X1) = X1,
left_identity ).
cnf(c_0_17,plain,
( multiply(X1,X2) != X3
| ~ subgroup_member(X2)
| ~ subgroup_member(X1)
| subgroup_member(X3) ),
inference(fof_simplification,[status(thm)],[closure_of_multiply]) ).
cnf(c_0_18,axiom,
multiply(X1,inverse(X1)) = identity,
right_inverse ).
cnf(c_0_19,plain,
multiply(inverse(X1),multiply(X1,X2)) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16]) ).
cnf(c_0_20,negated_conjecture,
multiply(b,inverse(a)) = c,
b_times_a_inverse_is_c ).
cnf(c_0_21,plain,
( multiply(X1,X2) != X3
| ~ subgroup_member(X2)
| ~ subgroup_member(X1)
| subgroup_member(X3) ),
c_0_17 ).
cnf(c_0_22,negated_conjecture,
~ subgroup_member(d),
inference(fof_simplification,[status(thm)],[prove_d_in_O2]) ).
cnf(c_0_23,plain,
multiply(X1,multiply(X2,inverse(multiply(X1,X2)))) = identity,
inference(spm,[status(thm)],[c_0_18,c_0_14]) ).
cnf(c_0_24,negated_conjecture,
multiply(inverse(b),c) = inverse(a),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_25,axiom,
inverse(inverse(X1)) = X1,
inverse_inverse ).
cnf(c_0_26,plain,
( ~ subgroup_member(X1)
| ~ subgroup_member(X2)
| subgroup_member(multiply(X1,X2)) ),
inference(er,[status(thm)],[c_0_21]) ).
cnf(c_0_27,negated_conjecture,
subgroup_member(b),
b_in_O2 ).
cnf(c_0_28,plain,
( ~ subgroup_member(X1)
| subgroup_member(inverse(X1)) ),
inference(fof_simplification,[status(thm)],[closure_of_inverse]) ).
cnf(c_0_29,negated_conjecture,
multiply(a,c) = d,
a_times_c_is_d ).
cnf(c_0_30,negated_conjecture,
~ subgroup_member(d),
c_0_22 ).
cnf(c_0_31,negated_conjecture,
multiply(inverse(b),multiply(c,a)) = identity,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_25]) ).
cnf(c_0_32,axiom,
multiply(X1,identity) = X1,
right_identity ).
cnf(c_0_33,negated_conjecture,
( ~ subgroup_member(inverse(a))
| subgroup_member(c) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_20]),c_0_27])]) ).
cnf(c_0_34,plain,
( ~ subgroup_member(X1)
| subgroup_member(inverse(X1)) ),
c_0_28 ).
cnf(c_0_35,negated_conjecture,
( ~ subgroup_member(a)
| ~ subgroup_member(c) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_29]),c_0_30]) ).
cnf(c_0_36,axiom,
( multiply(X1,element_in_O2(X1,X2)) = X2
| subgroup_member(X2)
| subgroup_member(X1) ),
property_of_O2 ).
cnf(c_0_37,plain,
( ~ subgroup_member(inverse(X2))
| ~ subgroup_member(multiply(X2,X1))
| subgroup_member(X1) ),
inference(spm,[status(thm)],[c_0_26,c_0_19]) ).
cnf(c_0_38,negated_conjecture,
multiply(c,a) = b,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_31]),c_0_25]),c_0_32]) ).
cnf(c_0_39,negated_conjecture,
~ subgroup_member(a),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_35]) ).
cnf(c_0_40,negated_conjecture,
multiply(inverse(a),d) = c,
inference(spm,[status(thm)],[c_0_19,c_0_29]) ).
cnf(c_0_41,plain,
( subgroup_member(X2)
| subgroup_member(X1)
| multiply(inverse(X1),X2) = element_in_O2(X1,X2) ),
inference(spm,[status(thm)],[c_0_19,c_0_36]) ).
cnf(c_0_42,negated_conjecture,
~ subgroup_member(inverse(c)),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_27])]),c_0_39]) ).
cnf(c_0_43,axiom,
( subgroup_member(element_in_O2(X1,X2))
| subgroup_member(X2)
| subgroup_member(X1) ),
an_element_in_O2 ).
cnf(c_0_44,negated_conjecture,
element_in_O2(a,d) = c,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_39]),c_0_30]) ).
cnf(c_0_45,negated_conjecture,
~ subgroup_member(c),
inference(spm,[status(thm)],[c_0_42,c_0_34]) ).
cnf(c_0_46,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_44]),c_0_45]),c_0_30]),c_0_39]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : GRP039-7 : TPTP v9.3.1. Bugfixed v1.0.1.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.07/0.34 % Computer : n018.cluster.edu
% 0.07/0.34 % Model : x86_64 x86_64
% 0.07/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.34 % Memory : 8046.5625MB
% 0.07/0.34 % OS : Linux 6.8.0-71-generic
% 0.07/0.34 % CPULimit : 300
% 0.07/0.34 % WCLimit : 300
% 0.07/0.34 % DateTime : Sun Sep 20 19:57:42 UTC 2026
% 0.07/0.34 % CPUTime :
% 0.07/0.34 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: FSMSSMSSSSSNFFN.
% 0.13/0.41 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.41 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN 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--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 49646 completed with status 0
% 0.13/0.41 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.13/0.41 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.13/0.41 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.41 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN 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: FGUSM-FFSS21-SFFFFFNN
% 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--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.13/0.41 % Starting G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_S04BN 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 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 49652 completed with status 0
% 0.13/0.41 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.13/0.41 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.13/0.41 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.41 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN 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: FGUSM-FFSS21-SFFFFFNN
% 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--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.13/0.41 % Preprocessing time : 0.001 s
% 0.13/0.41 % Presaturation interreduction done
% 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 : 16
% 0.13/0.41 % Removed by relevancy pruning/SinE : 0
% 0.13/0.41 % Initial clauses : 16
% 0.13/0.41 % Removed in clause preprocessing : 0
% 0.13/0.41 % Initial clauses in saturation : 16
% 0.13/0.41 % Processed clauses : 161
% 0.13/0.41 % ...of these trivial : 1
% 0.13/0.41 % ...subsumed : 71
% 0.13/0.41 % ...remaining for further processing : 89
% 0.13/0.41 % Other redundant clauses eliminated : 1
% 0.13/0.41 % Clauses deleted for lack of memory : 0
% 0.13/0.41 % Backward-subsumed : 4
% 0.13/0.41 % Backward-rewritten : 5
% 0.13/0.41 % Generated clauses : 640
% 0.13/0.41 % ...of the previous two non-redundant : 442
% 0.13/0.41 % ...aggressively subsumed : 0
% 0.13/0.41 % Contextual simplify-reflections : 1
% 0.13/0.41 % Paramodulations : 639
% 0.13/0.41 % Factorizations : 0
% 0.13/0.41 % NegExts : 0
% 0.13/0.41 % Equation resolutions : 1
% 0.13/0.41 % Disequality decompositions : 0
% 0.13/0.41 % Total rewrite steps : 541
% 0.13/0.41 % ...of those cached : 381
% 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 : 63
% 0.13/0.41 % Positive orientable unit clauses : 35
% 0.13/0.41 % Positive unorientable unit clauses: 0
% 0.13/0.41 % Negative unit clauses : 7
% 0.13/0.41 % Non-unit-clauses : 21
% 0.13/0.41 % Current number of unprocessed clauses: 309
% 0.13/0.41 % ...number of literals in the above : 734
% 0.13/0.41 % Current number of archived formulas : 0
% 0.13/0.41 % Current number of archived clauses : 25
% 0.13/0.41 % Clause-clause subsumption calls (NU) : 153
% 0.13/0.41 % Rec. Clause-clause subsumption calls : 143
% 0.13/0.41 % Non-unit clause-clause subsumptions : 7
% 0.13/0.41 % Unit Clause-clause subsumption calls : 65
% 0.13/0.41 % Rewrite failures with RHS unbound : 0
% 0.13/0.41 % BW rewrite match attempts : 7
% 0.13/0.41 % BW rewrite match successes : 4
% 0.13/0.41 % Condensation attempts : 0
% 0.13/0.41 % Condensation successes : 0
% 0.13/0.41 % Termbank termtop insertions : 6898
% 0.13/0.41 % Search garbage collected termcells : 10
% 0.13/0.41
% 0.13/0.41 % -------------------------------------------------
% 0.13/0.41 % User time : 0.008 s
% 0.13/0.41 % System time : 0.003 s
% 0.13/0.41 % Total time : 0.010 s
% 0.13/0.41 % Maximum resident set size: 3640 pages
% 0.13/0.41
% 0.13/0.41 % -------------------------------------------------
% 0.13/0.41 % User time : 0.030 s
% 0.13/0.41 % System time : 0.011 s
% 0.13/0.41 % Total time : 0.042 s
% 0.13/0.41 % Maximum resident set size: 4608 pages
% 0.13/0.41 % E exiting
%------------------------------------------------------------------------------