%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : GRP039-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 : n019.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.15s 0.45s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 13
% Syntax : Number of clauses : 46 ( 29 unt; 8 nHn; 25 RR)
% Number of literals : 75 ( 29 equ; 22 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(closure_of_multiply,axiom,
( multiply(X1,X2) != X3
| ~ subgroup_member(X2)
| ~ subgroup_member(X1)
| subgroup_member(X3) ),
file('/export/starexec/sandbox/benchmark/Axioms/GRP004-1.ax',closure_of_multiply) ).
cnf(associativity,axiom,
multiply(multiply(X1,X2),X3) = multiply(X1,multiply(X2,X3)),
file('/export/starexec/sandbox/benchmark/Axioms/GRP004-0.ax',associativity) ).
cnf(a_times_c_is_d,negated_conjecture,
multiply(a,c) = d,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',a_times_c_is_d) ).
cnf(property_of_O2,axiom,
( multiply(X1,element_in_O2(X1,X2)) = X2
| subgroup_member(X2)
| subgroup_member(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',property_of_O2) ).
cnf(prove_d_in_O2,negated_conjecture,
~ subgroup_member(d),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_d_in_O2) ).
cnf(b_times_a_inverse_is_c,negated_conjecture,
multiply(b,inverse(a)) = c,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',b_times_a_inverse_is_c) ).
cnf(left_inverse,axiom,
multiply(inverse(X1),X1) = identity,
file('/export/starexec/sandbox/benchmark/Axioms/GRP004-0.ax',left_inverse) ).
cnf(left_identity,axiom,
multiply(identity,X1) = X1,
file('/export/starexec/sandbox/benchmark/Axioms/GRP004-0.ax',left_identity) ).
cnf(right_identity,axiom,
multiply(X1,identity) = X1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',right_identity) ).
cnf(b_in_O2,negated_conjecture,
subgroup_member(b),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',b_in_O2) ).
cnf(closure_of_inverse,axiom,
( ~ subgroup_member(X1)
| subgroup_member(inverse(X1)) ),
file('/export/starexec/sandbox/benchmark/Axioms/GRP004-1.ax',closure_of_inverse) ).
cnf(right_inverse,axiom,
multiply(X1,inverse(X1)) = identity,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',right_inverse) ).
cnf(an_element_in_O2,axiom,
( subgroup_member(element_in_O2(X1,X2))
| subgroup_member(X2)
| subgroup_member(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',an_element_in_O2) ).
cnf(c_0_13,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_14,axiom,
multiply(multiply(X1,X2),X3) = multiply(X1,multiply(X2,X3)),
associativity ).
cnf(c_0_15,negated_conjecture,
multiply(a,c) = d,
a_times_c_is_d ).
cnf(c_0_16,axiom,
( multiply(X1,element_in_O2(X1,X2)) = X2
| subgroup_member(X2)
| subgroup_member(X1) ),
property_of_O2 ).
cnf(c_0_17,negated_conjecture,
~ subgroup_member(d),
inference(fof_simplification,[status(thm)],[prove_d_in_O2]) ).
cnf(c_0_18,negated_conjecture,
multiply(b,inverse(a)) = c,
b_times_a_inverse_is_c ).
cnf(c_0_19,plain,
( multiply(X1,X2) != X3
| ~ subgroup_member(X2)
| ~ subgroup_member(X1)
| subgroup_member(X3) ),
c_0_13 ).
cnf(c_0_20,axiom,
multiply(inverse(X1),X1) = identity,
left_inverse ).
cnf(c_0_21,axiom,
multiply(identity,X1) = X1,
left_identity ).
cnf(c_0_22,negated_conjecture,
multiply(a,multiply(c,X1)) = multiply(d,X1),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_23,plain,
( subgroup_member(X3)
| subgroup_member(multiply(X1,X2))
| multiply(X1,multiply(X2,element_in_O2(multiply(X1,X2),X3))) = X3 ),
inference(spm,[status(thm)],[c_0_14,c_0_16]) ).
cnf(c_0_24,negated_conjecture,
~ subgroup_member(d),
c_0_17 ).
cnf(c_0_25,negated_conjecture,
multiply(b,multiply(inverse(a),X1)) = multiply(c,X1),
inference(spm,[status(thm)],[c_0_14,c_0_18]) ).
cnf(c_0_26,axiom,
multiply(X1,identity) = X1,
right_identity ).
cnf(c_0_27,plain,
( ~ subgroup_member(X1)
| ~ subgroup_member(X2)
| subgroup_member(multiply(X1,X2)) ),
inference(er,[status(thm)],[c_0_19]) ).
cnf(c_0_28,negated_conjecture,
subgroup_member(b),
b_in_O2 ).
cnf(c_0_29,plain,
( ~ subgroup_member(X1)
| subgroup_member(inverse(X1)) ),
inference(fof_simplification,[status(thm)],[closure_of_inverse]) ).
cnf(c_0_30,plain,
multiply(inverse(X1),multiply(X1,X2)) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_20]),c_0_21]) ).
cnf(c_0_31,negated_conjecture,
( subgroup_member(X1)
| multiply(d,element_in_O2(d,X1)) = X1 ),
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_15]),c_0_15]),c_0_24]) ).
cnf(c_0_32,axiom,
multiply(X1,inverse(X1)) = identity,
right_inverse ).
cnf(c_0_33,negated_conjecture,
multiply(c,a) = b,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_20]),c_0_26]) ).
cnf(c_0_34,negated_conjecture,
( ~ subgroup_member(inverse(a))
| subgroup_member(c) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_18]),c_0_28])]) ).
cnf(c_0_35,plain,
( ~ subgroup_member(X1)
| subgroup_member(inverse(X1)) ),
c_0_29 ).
cnf(c_0_36,negated_conjecture,
( ~ subgroup_member(a)
| ~ subgroup_member(c) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_15]),c_0_24]) ).
cnf(c_0_37,axiom,
( subgroup_member(element_in_O2(X1,X2))
| subgroup_member(X2)
| subgroup_member(X1) ),
an_element_in_O2 ).
cnf(c_0_38,negated_conjecture,
( subgroup_member(X1)
| element_in_O2(d,X1) = multiply(inverse(d),X1) ),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_39,negated_conjecture,
multiply(d,inverse(c)) = a,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_32]),c_0_26]) ).
cnf(c_0_40,negated_conjecture,
multiply(inverse(c),b) = a,
inference(spm,[status(thm)],[c_0_30,c_0_33]) ).
cnf(c_0_41,negated_conjecture,
~ subgroup_member(a),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_36]) ).
cnf(c_0_42,negated_conjecture,
( subgroup_member(X1)
| subgroup_member(multiply(inverse(d),X1)) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_24]) ).
cnf(c_0_43,negated_conjecture,
multiply(inverse(d),a) = inverse(c),
inference(spm,[status(thm)],[c_0_30,c_0_39]) ).
cnf(c_0_44,negated_conjecture,
~ subgroup_member(inverse(c)),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_40]),c_0_28])]),c_0_41]) ).
cnf(c_0_45,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43]),c_0_44]),c_0_41]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GRP039-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.12/0.37 % Computer : n019.cluster.edu
% 0.12/0.37 % Model : x86_64 x86_64
% 0.12/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.37 % Memory : 8046.5625MB
% 0.12/0.37 % OS : Linux 6.8.0-71-generic
% 0.12/0.37 % CPULimit : 300
% 0.12/0.37 % WCLimit : 300
% 0.12/0.37 % DateTime : Sun Sep 20 19:55:34 UTC 2026
% 0.12/0.38 % CPUTime :
% 0.12/0.38 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.15/0.42 Running first-order theorem proving
% 0.15/0.42 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.15/0.45 % Version: 3.5.1
% 0.15/0.45 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.15/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.45 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.15/0.45 % Starting new_bool_3 with 300s (1) cores
% 0.15/0.45 % Starting new_bool_1 with 300s (1) cores
% 0.15/0.45 % Starting sh5l with 300s (1) cores
% 0.15/0.45 % G-E--_302_C18_F1_URBAN_RG_S04BN with pid 787330 completed with status 0
% 0.15/0.45 % Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.15/0.45 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.15/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.45 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.15/0.45 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.15/0.45 % No SInE strategy applied
% 0.15/0.45 % Search class: FGUSM-FFSS21-SFFFFFNN
% 0.15/0.45 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/0.45 % Starting SubtermCWHack with 136s (1) cores
% 0.15/0.45 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.15/0.45 % Starting G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_S04BN with 136s (1) cores
% 0.15/0.45 % Starting new_bool_3 with 136s (1) cores
% 0.15/0.45 % Starting new_bool_1 with 136s (1) cores
% 0.15/0.45 % G-E--_302_C18_F1_URBAN_RG_S04BN with pid 787336 completed with status 0
% 0.15/0.45 % Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.15/0.45 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.15/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.45 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.15/0.45 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.15/0.45 % No SInE strategy applied
% 0.15/0.45 % Search class: FGUSM-FFSS21-SFFFFFNN
% 0.15/0.45 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/0.45 % Starting SubtermCWHack with 136s (1) cores
% 0.15/0.45 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.15/0.45 % Preprocessing time : 0.001 s
% 0.15/0.45
% 0.15/0.45 % Proof found!
% 0.15/0.45 % SZS status Unsatisfiable
% 0.15/0.45 % SZS output start CNFRefutation
% See solution above
% 0.15/0.45 % Parsed axioms : 13
% 0.15/0.45 % Removed by relevancy pruning/SinE : 0
% 0.15/0.45 % Initial clauses : 13
% 0.15/0.45 % Removed in clause preprocessing : 0
% 0.15/0.45 % Initial clauses in saturation : 13
% 0.15/0.45 % Processed clauses : 105
% 0.15/0.45 % ...of these trivial : 6
% 0.15/0.45 % ...subsumed : 33
% 0.15/0.45 % ...remaining for further processing : 66
% 0.15/0.45 % Other redundant clauses eliminated : 16
% 0.15/0.45 % Clauses deleted for lack of memory : 0
% 0.15/0.45 % Backward-subsumed : 9
% 0.15/0.45 % Backward-rewritten : 1
% 0.15/0.45 % Generated clauses : 557
% 0.15/0.45 % ...of the previous two non-redundant : 375
% 0.15/0.45 % ...aggressively subsumed : 0
% 0.15/0.45 % Contextual simplify-reflections : 3
% 0.15/0.45 % Paramodulations : 537
% 0.15/0.45 % Factorizations : 2
% 0.15/0.45 % NegExts : 0
% 0.15/0.45 % Equation resolutions : 18
% 0.15/0.45 % Disequality decompositions : 0
% 0.15/0.45 % Total rewrite steps : 439
% 0.15/0.45 % ...of those cached : 270
% 0.15/0.45 % Propositional unsat checks : 0
% 0.15/0.45 % Propositional check models : 0
% 0.15/0.45 % Propositional check unsatisfiable : 0
% 0.15/0.45 % Propositional clauses : 0
% 0.15/0.45 % Propositional clauses after purity: 0
% 0.15/0.45 % Propositional unsat core size : 0
% 0.15/0.45 % Propositional preprocessing time : 0.000
% 0.15/0.45 % Propositional encoding time : 0.000
% 0.15/0.45 % Propositional solver time : 0.000
% 0.15/0.45 % Success case prop preproc time : 0.000
% 0.15/0.45 % Success case prop encoding time : 0.000
% 0.15/0.45 % Success case prop solver time : 0.000
% 0.15/0.45 % Current number of processed clauses : 56
% 0.15/0.45 % Positive orientable unit clauses : 26
% 0.15/0.45 % Positive unorientable unit clauses: 0
% 0.15/0.45 % Negative unit clauses : 10
% 0.15/0.45 % Non-unit-clauses : 20
% 0.15/0.45 % Current number of unprocessed clauses: 264
% 0.15/0.45 % ...number of literals in the above : 688
% 0.15/0.45 % Current number of archived formulas : 0
% 0.15/0.45 % Current number of archived clauses : 10
% 0.15/0.45 % Clause-clause subsumption calls (NU) : 193
% 0.15/0.45 % Rec. Clause-clause subsumption calls : 137
% 0.15/0.45 % Non-unit clause-clause subsumptions : 12
% 0.15/0.45 % Unit Clause-clause subsumption calls : 102
% 0.15/0.45 % Rewrite failures with RHS unbound : 0
% 0.15/0.45 % BW rewrite match attempts : 4
% 0.15/0.45 % BW rewrite match successes : 1
% 0.15/0.45 % Condensation attempts : 0
% 0.15/0.45 % Condensation successes : 0
% 0.15/0.45 % Termbank termtop insertions : 5842
% 0.15/0.45 % Search garbage collected termcells : 10
% 0.15/0.45
% 0.15/0.45 % -------------------------------------------------
% 0.15/0.45 % User time : 0.007 s
% 0.15/0.45 % System time : 0.003 s
% 0.15/0.45 % Total time : 0.010 s
% 0.15/0.45 % Maximum resident set size: 3588 pages
% 0.15/0.45
% 0.15/0.45 % -------------------------------------------------
% 0.15/0.45 % User time : 0.034 s
% 0.15/0.45 % System time : 0.010 s
% 0.15/0.45 % Total time : 0.044 s
% 0.15/0.45 % Maximum resident set size: 4608 pages
% 0.15/0.45 % E exiting
%------------------------------------------------------------------------------