TSTP Solution File: GRP033-3 by E-SAT---3.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E-SAT---3.1
% Problem  : GRP033-3 : TPTP v8.1.2. Bugfixed v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E %s %d THM

% Computer : n027.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 2400s
% WCLimit  : 300s
% DateTime : Tue Oct 10 17:43:33 EDT 2023

% Result   : Unsatisfiable 0.21s 0.50s
% Output   : CNFRefutation 0.21s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :    6
% Syntax   : Number of clauses     :   15 (  11 unt;   0 nHn;   9 RR)
%            Number of literals    :   25 (   0 equ;  14 neg)
%            Maximal clause size   :    4 (   1 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-3 aty)
%            Number of functors    :    4 (   4 usr;   2 con; 0-1 aty)
%            Number of variables   :   15 (   1 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(prove_subgr2,negated_conjecture,
    ( ~ product(j(X1),X1,j(X1))
    | ~ product(X1,j(X1),j(X1))
    | ~ subgroup_member(X1) ),
    file('/export/starexec/sandbox/tmp/tmp.y5eVaVs9tE/E---3.1_30286.p',prove_subgr2) ).

cnf(right_identity,axiom,
    product(X1,identity,X1),
    file('/export/starexec/sandbox/tmp/tmp.y5eVaVs9tE/E---3.1_30286.p',right_identity) ).

cnf(left_identity,axiom,
    product(identity,X1,X1),
    file('/export/starexec/sandbox/tmp/tmp.y5eVaVs9tE/E---3.1_30286.p',left_identity) ).

cnf(closure_of_product_and_inverse,axiom,
    ( subgroup_member(X3)
    | ~ subgroup_member(X1)
    | ~ subgroup_member(X2)
    | ~ product(X1,inverse(X2),X3) ),
    file('/export/starexec/sandbox/tmp/tmp.y5eVaVs9tE/E---3.1_30286.p',closure_of_product_and_inverse) ).

cnf(right_inverse,axiom,
    product(X1,inverse(X1),identity),
    file('/export/starexec/sandbox/tmp/tmp.y5eVaVs9tE/E---3.1_30286.p',right_inverse) ).

cnf(a_is_in_subgroup,hypothesis,
    subgroup_member(a),
    file('/export/starexec/sandbox/tmp/tmp.y5eVaVs9tE/E---3.1_30286.p',a_is_in_subgroup) ).

cnf(c_0_6,negated_conjecture,
    ( ~ product(j(X1),X1,j(X1))
    | ~ product(X1,j(X1),j(X1))
    | ~ subgroup_member(X1) ),
    prove_subgr2 ).

cnf(c_0_7,axiom,
    product(X1,identity,X1),
    right_identity ).

cnf(c_0_8,axiom,
    product(identity,X1,X1),
    left_identity ).

cnf(c_0_9,axiom,
    ( subgroup_member(X3)
    | ~ subgroup_member(X1)
    | ~ subgroup_member(X2)
    | ~ product(X1,inverse(X2),X3) ),
    closure_of_product_and_inverse ).

cnf(c_0_10,axiom,
    product(X1,inverse(X1),identity),
    right_inverse ).

cnf(c_0_11,negated_conjecture,
    ~ subgroup_member(identity),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_7]),c_0_8])]) ).

cnf(c_0_12,hypothesis,
    subgroup_member(a),
    a_is_in_subgroup ).

cnf(c_0_13,plain,
    ~ subgroup_member(X1),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_11]) ).

cnf(c_0_14,hypothesis,
    $false,
    inference(sr,[status(thm)],[c_0_12,c_0_13]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13  % Problem    : GRP033-3 : TPTP v8.1.2. Bugfixed v4.0.0.
% 0.07/0.14  % Command    : run_E %s %d THM
% 0.14/0.35  % Computer : n027.cluster.edu
% 0.14/0.35  % Model    : x86_64 x86_64
% 0.14/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35  % Memory   : 8042.1875MB
% 0.14/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35  % CPULimit   : 2400
% 0.14/0.35  % WCLimit    : 300
% 0.14/0.35  % DateTime   : Tue Oct  3 02:38:46 EDT 2023
% 0.14/0.35  % CPUTime    : 
% 0.21/0.49  Running first-order model finding
% 0.21/0.49  Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/tmp/tmp.y5eVaVs9tE/E---3.1_30286.p
% 0.21/0.50  # Version: 3.1pre001
% 0.21/0.50  # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.50  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.50  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.50  # Starting new_bool_3 with 300s (1) cores
% 0.21/0.50  # Starting new_bool_1 with 300s (1) cores
% 0.21/0.50  # Starting sh5l with 300s (1) cores
% 0.21/0.50  # new_bool_3 with pid 30390 completed with status 0
% 0.21/0.50  # Result found by new_bool_3
% 0.21/0.50  # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.50  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.50  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.50  # Starting new_bool_3 with 300s (1) cores
% 0.21/0.50  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/0.50  # Search class: FHHNM-FFSF11-SFFFFFNN
% 0.21/0.50  # partial match(1): FHHNF-FFSF11-SFFFFFNN
% 0.21/0.50  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.50  # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.21/0.50  # G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 30395 completed with status 0
% 0.21/0.50  # Result found by G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.21/0.50  # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.50  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.50  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.50  # Starting new_bool_3 with 300s (1) cores
% 0.21/0.50  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/0.50  # Search class: FHHNM-FFSF11-SFFFFFNN
% 0.21/0.50  # partial match(1): FHHNF-FFSF11-SFFFFFNN
% 0.21/0.50  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.50  # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.21/0.50  # Preprocessing time       : 0.001 s
% 0.21/0.50  # Presaturation interreduction done
% 0.21/0.50  
% 0.21/0.50  # Proof found!
% 0.21/0.50  # SZS status Unsatisfiable
% 0.21/0.50  # SZS output start CNFRefutation
% See solution above
% 0.21/0.50  # Parsed axioms                        : 22
% 0.21/0.50  # Removed by relevancy pruning/SinE    : 3
% 0.21/0.50  # Initial clauses                      : 19
% 0.21/0.50  # Removed in clause preprocessing      : 0
% 0.21/0.50  # Initial clauses in saturation        : 19
% 0.21/0.50  # Processed clauses                    : 35
% 0.21/0.50  # ...of these trivial                  : 0
% 0.21/0.50  # ...subsumed                          : 0
% 0.21/0.50  # ...remaining for further processing  : 35
% 0.21/0.50  # Other redundant clauses eliminated   : 0
% 0.21/0.50  # Clauses deleted for lack of memory   : 0
% 0.21/0.50  # Backward-subsumed                    : 5
% 0.21/0.50  # Backward-rewritten                   : 0
% 0.21/0.50  # Generated clauses                    : 15
% 0.21/0.50  # ...of the previous two non-redundant : 11
% 0.21/0.50  # ...aggressively subsumed             : 0
% 0.21/0.50  # Contextual simplify-reflections      : 0
% 0.21/0.50  # Paramodulations                      : 14
% 0.21/0.50  # Factorizations                       : 0
% 0.21/0.50  # NegExts                              : 0
% 0.21/0.50  # Equation resolutions                 : 0
% 0.21/0.50  # Total rewrite steps                  : 2
% 0.21/0.50  # Propositional unsat checks           : 0
% 0.21/0.50  #    Propositional check models        : 0
% 0.21/0.50  #    Propositional check unsatisfiable : 0
% 0.21/0.50  #    Propositional clauses             : 0
% 0.21/0.50  #    Propositional clauses after purity: 0
% 0.21/0.50  #    Propositional unsat core size     : 0
% 0.21/0.50  #    Propositional preprocessing time  : 0.000
% 0.21/0.50  #    Propositional encoding time       : 0.000
% 0.21/0.50  #    Propositional solver time         : 0.000
% 0.21/0.50  #    Success case prop preproc time    : 0.000
% 0.21/0.50  #    Success case prop encoding time   : 0.000
% 0.21/0.50  #    Success case prop solver time     : 0.000
% 0.21/0.50  # Current number of processed clauses  : 10
% 0.21/0.50  #    Positive orientable unit clauses  : 5
% 0.21/0.50  #    Positive unorientable unit clauses: 0
% 0.21/0.50  #    Negative unit clauses             : 1
% 0.21/0.50  #    Non-unit-clauses                  : 4
% 0.21/0.50  # Current number of unprocessed clauses: 14
% 0.21/0.50  # ...number of literals in the above   : 39
% 0.21/0.50  # Current number of archived formulas  : 0
% 0.21/0.50  # Current number of archived clauses   : 25
% 0.21/0.50  # Clause-clause subsumption calls (NU) : 16
% 0.21/0.50  # Rec. Clause-clause subsumption calls : 16
% 0.21/0.50  # Non-unit clause-clause subsumptions  : 0
% 0.21/0.50  # Unit Clause-clause subsumption calls : 9
% 0.21/0.50  # Rewrite failures with RHS unbound    : 0
% 0.21/0.50  # BW rewrite match attempts            : 0
% 0.21/0.50  # BW rewrite match successes           : 0
% 0.21/0.50  # Condensation attempts                : 0
% 0.21/0.50  # Condensation successes               : 0
% 0.21/0.50  # Termbank termtop insertions          : 658
% 0.21/0.50  
% 0.21/0.50  # -------------------------------------------------
% 0.21/0.50  # User time                : 0.004 s
% 0.21/0.50  # System time              : 0.002 s
% 0.21/0.50  # Total time               : 0.005 s
% 0.21/0.50  # Maximum resident set size: 1624 pages
% 0.21/0.50  
% 0.21/0.50  # -------------------------------------------------
% 0.21/0.50  # User time                : 0.005 s
% 0.21/0.50  # System time              : 0.004 s
% 0.21/0.50  # Total time               : 0.009 s
% 0.21/0.50  # Maximum resident set size: 1688 pages
% 0.21/0.50  % E---3.1 exiting
%------------------------------------------------------------------------------