TSTP Solution File: GRP012-1 by E---3.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E---3.1
% Problem  : GRP012-1 : TPTP v8.1.2. Released v1.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E %s %d THM

% Computer : n029.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:36:06 EDT 2023

% Result   : Unsatisfiable 0.16s 0.46s
% Output   : CNFRefutation 0.16s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    9
% Syntax   : Number of clauses     :   30 (  17 unt;   0 nHn;  24 RR)
%            Number of literals    :   56 (   4 equ;  28 neg)
%            Maximal clause size   :    4 (   1 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-3 aty)
%            Number of functors    :    6 (   6 usr;   5 con; 0-1 aty)
%            Number of variables   :   57 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(associativity1,axiom,
    ( product(X1,X5,X6)
    | ~ product(X1,X2,X3)
    | ~ product(X2,X4,X5)
    | ~ product(X3,X4,X6) ),
    file('/export/starexec/sandbox/tmp/tmp.1je4ZQS8t7/E---3.1_7802.p',associativity1) ).

cnf(left_inverse,axiom,
    product(inverse(X1),X1,identity),
    file('/export/starexec/sandbox/tmp/tmp.1je4ZQS8t7/E---3.1_7802.p',left_inverse) ).

cnf(associativity2,axiom,
    ( product(X3,X4,X6)
    | ~ product(X1,X2,X3)
    | ~ product(X2,X4,X5)
    | ~ product(X1,X5,X6) ),
    file('/export/starexec/sandbox/tmp/tmp.1je4ZQS8t7/E---3.1_7802.p',associativity2) ).

cnf(inverse_b_multiply_inverse_a_is_d,hypothesis,
    product(inverse(b),inverse(a),d),
    file('/export/starexec/sandbox/tmp/tmp.1je4ZQS8t7/E---3.1_7802.p',inverse_b_multiply_inverse_a_is_d) ).

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

cnf(a_multiply_b_is_c,hypothesis,
    product(a,b,c),
    file('/export/starexec/sandbox/tmp/tmp.1je4ZQS8t7/E---3.1_7802.p',a_multiply_b_is_c) ).

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

cnf(total_function2,axiom,
    ( X3 = X4
    | ~ product(X1,X2,X3)
    | ~ product(X1,X2,X4) ),
    file('/export/starexec/sandbox/tmp/tmp.1je4ZQS8t7/E---3.1_7802.p',total_function2) ).

cnf(prove_c_multiply_d_is_identity,negated_conjecture,
    ~ product(c,d,identity),
    file('/export/starexec/sandbox/tmp/tmp.1je4ZQS8t7/E---3.1_7802.p',prove_c_multiply_d_is_identity) ).

cnf(c_0_9,axiom,
    ( product(X1,X5,X6)
    | ~ product(X1,X2,X3)
    | ~ product(X2,X4,X5)
    | ~ product(X3,X4,X6) ),
    associativity1 ).

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

cnf(c_0_11,axiom,
    ( product(X3,X4,X6)
    | ~ product(X1,X2,X3)
    | ~ product(X2,X4,X5)
    | ~ product(X1,X5,X6) ),
    associativity2 ).

cnf(c_0_12,hypothesis,
    product(inverse(b),inverse(a),d),
    inverse_b_multiply_inverse_a_is_d ).

cnf(c_0_13,plain,
    ( product(inverse(X1),X2,X3)
    | ~ product(identity,X4,X3)
    | ~ product(X1,X4,X2) ),
    inference(spm,[status(thm)],[c_0_9,c_0_10]) ).

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

cnf(c_0_15,hypothesis,
    ( product(d,X1,X2)
    | ~ product(inverse(a),X1,X3)
    | ~ product(inverse(b),X3,X2) ),
    inference(spm,[status(thm)],[c_0_11,c_0_12]) ).

cnf(c_0_16,plain,
    ( product(inverse(X1),X2,X3)
    | ~ product(X1,X3,X2) ),
    inference(spm,[status(thm)],[c_0_13,c_0_14]) ).

cnf(c_0_17,hypothesis,
    product(a,b,c),
    a_multiply_b_is_c ).

cnf(c_0_18,plain,
    ( product(identity,X1,X2)
    | ~ product(inverse(X3),X4,X2)
    | ~ product(X3,X1,X4) ),
    inference(spm,[status(thm)],[c_0_11,c_0_10]) ).

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

cnf(c_0_20,hypothesis,
    ( product(d,X1,identity)
    | ~ product(inverse(a),X1,b) ),
    inference(spm,[status(thm)],[c_0_15,c_0_10]) ).

cnf(c_0_21,hypothesis,
    product(inverse(a),c,b),
    inference(spm,[status(thm)],[c_0_16,c_0_17]) ).

cnf(c_0_22,axiom,
    ( X3 = X4
    | ~ product(X1,X2,X3)
    | ~ product(X1,X2,X4) ),
    total_function2 ).

cnf(c_0_23,plain,
    ( product(identity,X1,inverse(X2))
    | ~ product(X2,X1,identity) ),
    inference(spm,[status(thm)],[c_0_18,c_0_19]) ).

cnf(c_0_24,hypothesis,
    product(d,c,identity),
    inference(spm,[status(thm)],[c_0_20,c_0_21]) ).

cnf(c_0_25,plain,
    ( X1 = X2
    | ~ product(identity,X1,X2) ),
    inference(spm,[status(thm)],[c_0_22,c_0_14]) ).

cnf(c_0_26,hypothesis,
    product(identity,c,inverse(d)),
    inference(spm,[status(thm)],[c_0_23,c_0_24]) ).

cnf(c_0_27,hypothesis,
    inverse(d) = c,
    inference(spm,[status(thm)],[c_0_25,c_0_26]) ).

cnf(c_0_28,negated_conjecture,
    ~ product(c,d,identity),
    prove_c_multiply_d_is_identity ).

cnf(c_0_29,hypothesis,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_27]),c_0_28]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11  % Problem    : GRP012-1 : TPTP v8.1.2. Released v1.0.0.
% 0.11/0.12  % Command    : run_E %s %d THM
% 0.12/0.32  % Computer : n029.cluster.edu
% 0.12/0.32  % Model    : x86_64 x86_64
% 0.12/0.32  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.32  % Memory   : 8042.1875MB
% 0.12/0.32  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.32  % CPULimit   : 2400
% 0.12/0.32  % WCLimit    : 300
% 0.12/0.32  % DateTime   : Tue Oct  3 03:05:52 EDT 2023
% 0.12/0.32  % CPUTime    : 
% 0.16/0.44  Running first-order theorem proving
% 0.16/0.44  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/tmp/tmp.1je4ZQS8t7/E---3.1_7802.p
% 0.16/0.46  # Version: 3.1pre001
% 0.16/0.46  # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/0.46  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.46  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/0.46  # Starting new_bool_3 with 300s (1) cores
% 0.16/0.46  # Starting new_bool_1 with 300s (1) cores
% 0.16/0.46  # Starting sh5l with 300s (1) cores
% 0.16/0.46  # new_bool_3 with pid 7881 completed with status 0
% 0.16/0.46  # Result found by new_bool_3
% 0.16/0.46  # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/0.46  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.46  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/0.46  # Starting new_bool_3 with 300s (1) cores
% 0.16/0.46  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.16/0.46  # Search class: FHUSM-FFSF11-SFFFFFNN
% 0.16/0.46  # partial match(1): FHUSM-FFSF21-SFFFFFNN
% 0.16/0.46  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.46  # Starting G-E--_208_C18_F1_AE_CS_SP_PI_S0a with 181s (1) cores
% 0.16/0.46  # G-E--_208_C18_F1_AE_CS_SP_PI_S0a with pid 7886 completed with status 0
% 0.16/0.46  # Result found by G-E--_208_C18_F1_AE_CS_SP_PI_S0a
% 0.16/0.46  # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/0.46  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.46  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/0.46  # Starting new_bool_3 with 300s (1) cores
% 0.16/0.46  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.16/0.46  # Search class: FHUSM-FFSF11-SFFFFFNN
% 0.16/0.46  # partial match(1): FHUSM-FFSF21-SFFFFFNN
% 0.16/0.46  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.46  # Starting G-E--_208_C18_F1_AE_CS_SP_PI_S0a with 181s (1) cores
% 0.16/0.46  # Preprocessing time       : 0.001 s
% 0.16/0.46  
% 0.16/0.46  # Proof found!
% 0.16/0.46  # SZS status Unsatisfiable
% 0.16/0.46  # SZS output start CNFRefutation
% See solution above
% 0.16/0.46  # Parsed axioms                        : 11
% 0.16/0.46  # Removed by relevancy pruning/SinE    : 1
% 0.16/0.46  # Initial clauses                      : 10
% 0.16/0.46  # Removed in clause preprocessing      : 0
% 0.16/0.46  # Initial clauses in saturation        : 10
% 0.16/0.46  # Processed clauses                    : 191
% 0.16/0.46  # ...of these trivial                  : 1
% 0.16/0.46  # ...subsumed                          : 79
% 0.16/0.46  # ...remaining for further processing  : 111
% 0.16/0.46  # Other redundant clauses eliminated   : 0
% 0.16/0.46  # Clauses deleted for lack of memory   : 0
% 0.16/0.46  # Backward-subsumed                    : 2
% 0.16/0.46  # Backward-rewritten                   : 5
% 0.16/0.46  # Generated clauses                    : 475
% 0.16/0.46  # ...of the previous two non-redundant : 317
% 0.16/0.46  # ...aggressively subsumed             : 0
% 0.16/0.46  # Contextual simplify-reflections      : 0
% 0.16/0.46  # Paramodulations                      : 475
% 0.16/0.46  # Factorizations                       : 0
% 0.16/0.46  # NegExts                              : 0
% 0.16/0.46  # Equation resolutions                 : 0
% 0.16/0.46  # Total rewrite steps                  : 197
% 0.16/0.46  # Propositional unsat checks           : 0
% 0.16/0.46  #    Propositional check models        : 0
% 0.16/0.46  #    Propositional check unsatisfiable : 0
% 0.16/0.46  #    Propositional clauses             : 0
% 0.16/0.46  #    Propositional clauses after purity: 0
% 0.16/0.46  #    Propositional unsat core size     : 0
% 0.16/0.46  #    Propositional preprocessing time  : 0.000
% 0.16/0.46  #    Propositional encoding time       : 0.000
% 0.16/0.46  #    Propositional solver time         : 0.000
% 0.16/0.46  #    Success case prop preproc time    : 0.000
% 0.16/0.46  #    Success case prop encoding time   : 0.000
% 0.16/0.46  #    Success case prop solver time     : 0.000
% 0.16/0.46  # Current number of processed clauses  : 104
% 0.16/0.46  #    Positive orientable unit clauses  : 13
% 0.16/0.46  #    Positive unorientable unit clauses: 0
% 0.16/0.46  #    Negative unit clauses             : 1
% 0.16/0.46  #    Non-unit-clauses                  : 90
% 0.16/0.46  # Current number of unprocessed clauses: 124
% 0.16/0.46  # ...number of literals in the above   : 292
% 0.16/0.46  # Current number of archived formulas  : 0
% 0.16/0.46  # Current number of archived clauses   : 7
% 0.16/0.46  # Clause-clause subsumption calls (NU) : 1231
% 0.16/0.46  # Rec. Clause-clause subsumption calls : 1162
% 0.16/0.46  # Non-unit clause-clause subsumptions  : 81
% 0.16/0.46  # Unit Clause-clause subsumption calls : 1
% 0.16/0.46  # Rewrite failures with RHS unbound    : 0
% 0.16/0.46  # BW rewrite match attempts            : 19
% 0.16/0.46  # BW rewrite match successes           : 3
% 0.16/0.46  # Condensation attempts                : 0
% 0.16/0.46  # Condensation successes               : 0
% 0.16/0.46  # Termbank termtop insertions          : 5440
% 0.16/0.46  
% 0.16/0.46  # -------------------------------------------------
% 0.16/0.46  # User time                : 0.008 s
% 0.16/0.46  # System time              : 0.003 s
% 0.16/0.46  # Total time               : 0.011 s
% 0.16/0.46  # Maximum resident set size: 1648 pages
% 0.16/0.46  
% 0.16/0.46  # -------------------------------------------------
% 0.16/0.46  # User time                : 0.010 s
% 0.16/0.46  # System time              : 0.004 s
% 0.16/0.46  # Total time               : 0.014 s
% 0.16/0.46  # Maximum resident set size: 1676 pages
% 0.16/0.46  % E---3.1 exiting
% 0.16/0.46  % E---3.1 exiting
%------------------------------------------------------------------------------