↑ Up

E---3.5.1.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E---3.5.1
% Problem  : GRP039-2 : 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:32 PM UTC 2026

% Result   : Unsatisfiable 0.14s 0.44s
% Output   : CNFRefutation 0.14s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :   13
% Syntax   : Number of clauses     :   50 (  32 unt;   5 nHn;  32 RR)
%            Number of literals    :   81 (  28 equ;  28 neg)
%            Maximal clause size   :    4 (   1 avg)
%            Maximal term depth    :    4 (   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   :   47 (   1 sgn)

% Comments : 
%------------------------------------------------------------------------------
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(prove_d_in_O2,negated_conjecture,
    ~ subgroup_member(d),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_d_in_O2) ).

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(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(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(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(right_identity,axiom,
    multiply(X1,identity) = X1,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',right_identity) ).

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(right_inverse,axiom,
    multiply(X1,inverse(X1)) = identity,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',right_inverse) ).

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,plain,
    ( multiply(X1,X2) != X3
    | ~ subgroup_member(X2)
    | ~ subgroup_member(X1)
    | subgroup_member(X3) ),
    c_0_13 ).

cnf(c_0_15,negated_conjecture,
    ~ subgroup_member(d),
    inference(fof_simplification,[status(thm)],[prove_d_in_O2]) ).

cnf(c_0_16,plain,
    ( ~ subgroup_member(X1)
    | ~ subgroup_member(X2)
    | subgroup_member(multiply(X1,X2)) ),
    inference(er,[status(thm)],[c_0_14]) ).

cnf(c_0_17,negated_conjecture,
    multiply(b,inverse(a)) = c,
    b_times_a_inverse_is_c ).

cnf(c_0_18,negated_conjecture,
    subgroup_member(b),
    b_in_O2 ).

cnf(c_0_19,plain,
    ( ~ subgroup_member(X1)
    | subgroup_member(inverse(X1)) ),
    inference(fof_simplification,[status(thm)],[closure_of_inverse]) ).

cnf(c_0_20,negated_conjecture,
    multiply(a,c) = d,
    a_times_c_is_d ).

cnf(c_0_21,negated_conjecture,
    ~ subgroup_member(d),
    c_0_15 ).

cnf(c_0_22,negated_conjecture,
    ( ~ subgroup_member(inverse(a))
    | subgroup_member(c) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18])]) ).

cnf(c_0_23,plain,
    ( ~ subgroup_member(X1)
    | subgroup_member(inverse(X1)) ),
    c_0_19 ).

cnf(c_0_24,negated_conjecture,
    ( ~ subgroup_member(a)
    | ~ subgroup_member(c) ),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_20]),c_0_21]) ).

cnf(c_0_25,axiom,
    ( multiply(X1,element_in_O2(X1,X2)) = X2
    | subgroup_member(X2)
    | subgroup_member(X1) ),
    property_of_O2 ).

cnf(c_0_26,axiom,
    multiply(multiply(X1,X2),X3) = multiply(X1,multiply(X2,X3)),
    associativity ).

cnf(c_0_27,negated_conjecture,
    ~ subgroup_member(a),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_24]) ).

cnf(c_0_28,negated_conjecture,
    ( subgroup_member(X1)
    | multiply(d,element_in_O2(d,X1)) = X1 ),
    inference(spm,[status(thm)],[c_0_21,c_0_25]) ).

cnf(c_0_29,plain,
    ( ~ subgroup_member(X3)
    | ~ subgroup_member(multiply(X1,X2))
    | subgroup_member(multiply(X1,multiply(X2,X3))) ),
    inference(spm,[status(thm)],[c_0_16,c_0_26]) ).

cnf(c_0_30,negated_conjecture,
    multiply(d,element_in_O2(d,a)) = a,
    inference(spm,[status(thm)],[c_0_27,c_0_28]) ).

cnf(c_0_31,axiom,
    multiply(inverse(X1),X1) = identity,
    left_inverse ).

cnf(c_0_32,axiom,
    multiply(identity,X1) = X1,
    left_identity ).

cnf(c_0_33,negated_conjecture,
    multiply(b,multiply(inverse(a),X1)) = multiply(c,X1),
    inference(spm,[status(thm)],[c_0_26,c_0_17]) ).

cnf(c_0_34,axiom,
    multiply(X1,identity) = X1,
    right_identity ).

cnf(c_0_35,negated_conjecture,
    ( ~ subgroup_member(multiply(X1,d))
    | ~ subgroup_member(element_in_O2(d,a))
    | subgroup_member(multiply(X1,a)) ),
    inference(spm,[status(thm)],[c_0_29,c_0_30]) ).

cnf(c_0_36,axiom,
    ( subgroup_member(element_in_O2(X1,X2))
    | subgroup_member(X2)
    | subgroup_member(X1) ),
    an_element_in_O2 ).

cnf(c_0_37,plain,
    ( ~ subgroup_member(X1)
    | subgroup_member(identity) ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_31]),c_0_23]) ).

cnf(c_0_38,negated_conjecture,
    multiply(a,multiply(c,X1)) = multiply(d,X1),
    inference(spm,[status(thm)],[c_0_26,c_0_20]) ).

cnf(c_0_39,axiom,
    multiply(X1,inverse(X1)) = identity,
    right_inverse ).

cnf(c_0_40,plain,
    multiply(inverse(X1),multiply(X1,X2)) = X2,
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_31]),c_0_32]) ).

cnf(c_0_41,negated_conjecture,
    multiply(c,a) = b,
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_31]),c_0_34]) ).

cnf(c_0_42,negated_conjecture,
    ( ~ subgroup_member(multiply(X1,d))
    | subgroup_member(multiply(X1,a)) ),
    inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_27]),c_0_21]) ).

cnf(c_0_43,negated_conjecture,
    subgroup_member(identity),
    inference(spm,[status(thm)],[c_0_37,c_0_18]) ).

cnf(c_0_44,negated_conjecture,
    multiply(d,inverse(c)) = a,
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_34]) ).

cnf(c_0_45,negated_conjecture,
    multiply(inverse(c),b) = a,
    inference(spm,[status(thm)],[c_0_40,c_0_41]) ).

cnf(c_0_46,negated_conjecture,
    subgroup_member(multiply(inverse(d),a)),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_31]),c_0_43])]) ).

cnf(c_0_47,negated_conjecture,
    multiply(inverse(d),a) = inverse(c),
    inference(spm,[status(thm)],[c_0_40,c_0_44]) ).

cnf(c_0_48,negated_conjecture,
    ~ subgroup_member(inverse(c)),
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_45]),c_0_18])]),c_0_27]) ).

cnf(c_0_49,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_46,c_0_47]),c_0_48]),
    [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/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.36  % Computer : n017.cluster.edu
% 0.11/0.36  % Model    : x86_64 x86_64
% 0.11/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.36  % Memory   : 8046.5625MB
% 0.11/0.36  % OS       : Linux 6.8.0-71-generic
% 0.11/0.36  % CPULimit : 300
% 0.11/0.36  % WCLimit  : 300
% 0.11/0.36  % DateTime : Sun Sep 20 19:50:41 UTC 2026
% 0.11/0.36  % CPUTime  : 
% 0.11/0.37  Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.14/0.41  Running first-order theorem proving
% 0.14/0.41  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.14/0.44  % Version: 3.5.1
% 0.14/0.44  % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.14/0.44  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.44  % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.14/0.44  % Starting new_bool_3 with 300s (1) cores
% 0.14/0.44  % Starting new_bool_1 with 300s (1) cores
% 0.14/0.44  % Starting sh5l with 300s (1) cores
% 0.14/0.44  % G-E--_302_C18_F1_URBAN_RG_S04BN with pid 483713 completed with status 0
% 0.14/0.44  % Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.14/0.44  % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.14/0.44  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.44  % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.14/0.44  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.14/0.44  % No SInE strategy applied
% 0.14/0.44  % Search class: FGUSM-FFSS21-SFFFFFNN
% 0.14/0.44  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.14/0.44  % Starting SubtermCWHack with 136s (1) cores
% 0.14/0.44  % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.14/0.44  % Starting G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_S04BN with 136s (1) cores
% 0.14/0.44  % Starting new_bool_3 with 136s (1) cores
% 0.14/0.44  % Starting new_bool_1 with 136s (1) cores
% 0.14/0.44  % G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_S04BN with pid 483722 completed with status 0
% 0.14/0.44  % Result found by G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_S04BN
% 0.14/0.44  % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.14/0.44  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.44  % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.14/0.44  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.14/0.44  % No SInE strategy applied
% 0.14/0.44  % Search class: FGUSM-FFSS21-SFFFFFNN
% 0.14/0.44  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.14/0.44  % Starting SubtermCWHack with 136s (1) cores
% 0.14/0.44  % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.14/0.44  % Starting G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_S04BN with 136s (1) cores
% 0.14/0.44  % Preprocessing time       : 0.001 s
% 0.14/0.44  % Presaturation interreduction done
% 0.14/0.44  
% 0.14/0.44  % Proof found!
% 0.14/0.44  % SZS status Unsatisfiable
% 0.14/0.44  % SZS output start CNFRefutation
% See solution above
% 0.14/0.44  % Parsed axioms                        : 13
% 0.14/0.44  % Removed by relevancy pruning/SinE    : 0
% 0.14/0.44  % Initial clauses                      : 13
% 0.14/0.44  % Removed in clause preprocessing      : 0
% 0.14/0.44  % Initial clauses in saturation        : 13
% 0.14/0.44  % Processed clauses                    : 82
% 0.14/0.44  % ...of these trivial                  : 3
% 0.14/0.44  % ...subsumed                          : 9
% 0.14/0.44  % ...remaining for further processing  : 70
% 0.14/0.44  % Other redundant clauses eliminated   : 1
% 0.14/0.44  % Clauses deleted for lack of memory   : 0
% 0.14/0.44  % Backward-subsumed                    : 4
% 0.14/0.44  % Backward-rewritten                   : 4
% 0.14/0.44  % Generated clauses                    : 280
% 0.14/0.44  % ...of the previous two non-redundant : 205
% 0.14/0.44  % ...aggressively subsumed             : 0
% 0.14/0.44  % Contextual simplify-reflections      : 2
% 0.14/0.44  % Paramodulations                      : 274
% 0.14/0.44  % Factorizations                       : 2
% 0.14/0.44  % NegExts                              : 0
% 0.14/0.44  % Equation resolutions                 : 1
% 0.14/0.44  % Disequality decompositions           : 0
% 0.14/0.44  % Total rewrite steps                  : 166
% 0.14/0.44  % ...of those cached                   : 90
% 0.14/0.44  % Propositional unsat checks           : 0
% 0.14/0.44  %    Propositional check models        : 0
% 0.14/0.44  %    Propositional check unsatisfiable : 0
% 0.14/0.44  %    Propositional clauses             : 0
% 0.14/0.44  %    Propositional clauses after purity: 0
% 0.14/0.44  %    Propositional unsat core size     : 0
% 0.14/0.44  %    Propositional preprocessing time  : 0.000
% 0.14/0.44  %    Propositional encoding time       : 0.000
% 0.14/0.44  %    Propositional solver time         : 0.000
% 0.14/0.44  %    Success case prop preproc time    : 0.000
% 0.14/0.44  %    Success case prop encoding time   : 0.000
% 0.14/0.44  %    Success case prop solver time     : 0.000
% 0.14/0.44  % Current number of processed clauses  : 45
% 0.14/0.44  %    Positive orientable unit clauses  : 30
% 0.14/0.44  %    Positive unorientable unit clauses: 0
% 0.14/0.44  %    Negative unit clauses             : 4
% 0.14/0.44  %    Non-unit-clauses                  : 11
% 0.14/0.44  % Current number of unprocessed clauses: 145
% 0.14/0.44  % ...number of literals in the above   : 292
% 0.14/0.44  % Current number of archived formulas  : 0
% 0.14/0.44  % Current number of archived clauses   : 24
% 0.14/0.44  % Clause-clause subsumption calls (NU) : 26
% 0.14/0.44  % Rec. Clause-clause subsumption calls : 25
% 0.14/0.44  % Non-unit clause-clause subsumptions  : 4
% 0.14/0.44  % Unit Clause-clause subsumption calls : 25
% 0.14/0.44  % Rewrite failures with RHS unbound    : 0
% 0.14/0.44  % BW rewrite match attempts            : 7
% 0.14/0.44  % BW rewrite match successes           : 5
% 0.14/0.44  % Condensation attempts                : 0
% 0.14/0.44  % Condensation successes               : 0
% 0.14/0.44  % Termbank termtop insertions          : 2993
% 0.14/0.44  % Search garbage collected termcells   : 10
% 0.14/0.44  
% 0.14/0.44  % -------------------------------------------------
% 0.14/0.44  % User time                : 0.009 s
% 0.14/0.44  % System time              : 0.002 s
% 0.14/0.44  % Total time               : 0.012 s
% 0.14/0.44  % Maximum resident set size: 3640 pages
% 0.14/0.44  
% 0.14/0.44  % -------------------------------------------------
% 0.14/0.44  % User time                : 0.039 s
% 0.14/0.44  % System time              : 0.015 s
% 0.14/0.44  % Total time               : 0.054 s
% 0.14/0.44  % Maximum resident set size: 4864 pages
% 0.14/0.44  % E exiting
%------------------------------------------------------------------------------