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

View Problem - Process Solution

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

% Computer : n004.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 136.31s 136.50s
% Output   : CNFRefutation 136.31s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    8
% Syntax   : Number of clauses     :   23 (  17 unt;   0 nHn;  15 RR)
%            Number of literals    :   31 (   6 equ;  10 neg)
%            Maximal clause size   :    3 (   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   :   25 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(total_function2,axiom,
    ( X3 = X4
    | ~ product(X1,X2,X3)
    | ~ product(X1,X2,X4) ),
    file('/export/starexec/sandbox2/tmp/tmp.nijce0Sb7U/E---3.1_17153.p',total_function2) ).

cnf(right_identity,axiom,
    product(X1,identity,X1),
    file('/export/starexec/sandbox2/tmp/tmp.nijce0Sb7U/E---3.1_17153.p',right_identity) ).

cnf(inverses_have_property,hypothesis,
    ( product(X1,X3,X2)
    | ~ product(inverse(X1),inverse(X2),X3) ),
    file('/export/starexec/sandbox2/tmp/tmp.nijce0Sb7U/E---3.1_17153.p',inverses_have_property) ).

cnf(left_inverse,axiom,
    product(inverse(X1),X1,identity),
    file('/export/starexec/sandbox2/tmp/tmp.nijce0Sb7U/E---3.1_17153.p',left_inverse) ).

cnf(a_times_b_is_c,hypothesis,
    product(a,b,c),
    file('/export/starexec/sandbox2/tmp/tmp.nijce0Sb7U/E---3.1_17153.p',a_times_b_is_c) ).

cnf(inverse_a_times_inverse_b_is_d,hypothesis,
    product(inverse(a),inverse(b),d),
    file('/export/starexec/sandbox2/tmp/tmp.nijce0Sb7U/E---3.1_17153.p',inverse_a_times_inverse_b_is_d) ).

cnf(prove_c_times_d_is_identity,negated_conjecture,
    ~ product(c,d,identity),
    file('/export/starexec/sandbox2/tmp/tmp.nijce0Sb7U/E---3.1_17153.p',prove_c_times_d_is_identity) ).

cnf(squareness,hypothesis,
    product(X1,X1,identity),
    file('/export/starexec/sandbox2/tmp/tmp.nijce0Sb7U/E---3.1_17153.p',squareness) ).

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

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

cnf(c_0_10,hypothesis,
    ( product(X1,X3,X2)
    | ~ product(inverse(X1),inverse(X2),X3) ),
    inverses_have_property ).

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

cnf(c_0_12,plain,
    ( X1 = X2
    | ~ product(X1,identity,X2) ),
    inference(spm,[status(thm)],[c_0_8,c_0_9]) ).

cnf(c_0_13,hypothesis,
    product(inverse(X1),identity,X1),
    inference(spm,[status(thm)],[c_0_10,c_0_11]) ).

cnf(c_0_14,hypothesis,
    product(a,b,c),
    a_times_b_is_c ).

cnf(c_0_15,hypothesis,
    product(inverse(a),inverse(b),d),
    inverse_a_times_inverse_b_is_d ).

cnf(c_0_16,hypothesis,
    inverse(X1) = X1,
    inference(spm,[status(thm)],[c_0_12,c_0_13]) ).

cnf(c_0_17,hypothesis,
    ( c = X1
    | ~ product(a,b,X1) ),
    inference(spm,[status(thm)],[c_0_8,c_0_14]) ).

cnf(c_0_18,hypothesis,
    product(a,b,d),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_15,c_0_16]),c_0_16]) ).

cnf(c_0_19,negated_conjecture,
    ~ product(c,d,identity),
    prove_c_times_d_is_identity ).

cnf(c_0_20,hypothesis,
    d = c,
    inference(spm,[status(thm)],[c_0_17,c_0_18]) ).

cnf(c_0_21,hypothesis,
    product(X1,X1,identity),
    squareness ).

cnf(c_0_22,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_19,c_0_20]),c_0_21])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13  % Problem    : GRP013-1 : TPTP v8.1.2. Released v1.0.0.
% 0.07/0.15  % Command    : run_E %s %d THM
% 0.14/0.36  % Computer : n004.cluster.edu
% 0.14/0.36  % Model    : x86_64 x86_64
% 0.14/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36  % Memory   : 8042.1875MB
% 0.14/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36  % CPULimit   : 2400
% 0.14/0.36  % WCLimit    : 300
% 0.14/0.36  % DateTime   : Tue Oct  3 02:16:45 EDT 2023
% 0.14/0.36  % CPUTime    : 
% 0.22/0.49  Running first-order theorem proving
% 0.22/0.49  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/tmp/tmp.nijce0Sb7U/E---3.1_17153.p
% 136.31/136.50  # Version: 3.1pre001
% 136.31/136.50  # Preprocessing class: FSMSSMSSSSSNFFN.
% 136.31/136.50  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 136.31/136.50  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 136.31/136.50  # Starting new_bool_3 with 300s (1) cores
% 136.31/136.50  # Starting new_bool_1 with 300s (1) cores
% 136.31/136.50  # Starting sh5l with 300s (1) cores
% 136.31/136.50  # sh5l with pid 17234 completed with status 0
% 136.31/136.50  # Result found by sh5l
% 136.31/136.50  # Preprocessing class: FSMSSMSSSSSNFFN.
% 136.31/136.50  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 136.31/136.50  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 136.31/136.50  # Starting new_bool_3 with 300s (1) cores
% 136.31/136.50  # Starting new_bool_1 with 300s (1) cores
% 136.31/136.50  # Starting sh5l with 300s (1) cores
% 136.31/136.50  # SinE strategy is gf500_gu_R04_F100_L20000
% 136.31/136.50  # Search class: FHUSM-FFSF11-SFFFFFNN
% 136.31/136.50  # partial match(1): FHUSM-FFSF21-SFFFFFNN
% 136.31/136.50  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 136.31/136.50  # Starting G-E--_208_C18_F1_AE_CS_SP_PI_S0a with 181s (1) cores
% 136.31/136.50  # G-E--_208_C18_F1_AE_CS_SP_PI_S0a with pid 17243 completed with status 0
% 136.31/136.50  # Result found by G-E--_208_C18_F1_AE_CS_SP_PI_S0a
% 136.31/136.50  # Preprocessing class: FSMSSMSSSSSNFFN.
% 136.31/136.50  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 136.31/136.50  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 136.31/136.50  # Starting new_bool_3 with 300s (1) cores
% 136.31/136.50  # Starting new_bool_1 with 300s (1) cores
% 136.31/136.50  # Starting sh5l with 300s (1) cores
% 136.31/136.50  # SinE strategy is gf500_gu_R04_F100_L20000
% 136.31/136.50  # Search class: FHUSM-FFSF11-SFFFFFNN
% 136.31/136.50  # partial match(1): FHUSM-FFSF21-SFFFFFNN
% 136.31/136.50  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 136.31/136.50  # Starting G-E--_208_C18_F1_AE_CS_SP_PI_S0a with 181s (1) cores
% 136.31/136.50  # Preprocessing time       : 0.001 s
% 136.31/136.50  
% 136.31/136.50  # Proof found!
% 136.31/136.50  # SZS status Unsatisfiable
% 136.31/136.50  # SZS output start CNFRefutation
% See solution above
% 136.31/136.50  # Parsed axioms                        : 13
% 136.31/136.50  # Removed by relevancy pruning/SinE    : 1
% 136.31/136.50  # Initial clauses                      : 12
% 136.31/136.50  # Removed in clause preprocessing      : 0
% 136.31/136.50  # Initial clauses in saturation        : 12
% 136.31/136.50  # Processed clauses                    : 24
% 136.31/136.50  # ...of these trivial                  : 0
% 136.31/136.50  # ...subsumed                          : 2
% 136.31/136.50  # ...remaining for further processing  : 22
% 136.31/136.50  # Other redundant clauses eliminated   : 0
% 136.31/136.50  # Clauses deleted for lack of memory   : 0
% 136.31/136.50  # Backward-subsumed                    : 0
% 136.31/136.50  # Backward-rewritten                   : 10
% 136.31/136.50  # Generated clauses                    : 98
% 136.31/136.50  # ...of the previous two non-redundant : 94
% 136.31/136.50  # ...aggressively subsumed             : 0
% 136.31/136.50  # Contextual simplify-reflections      : 0
% 136.31/136.50  # Paramodulations                      : 98
% 136.31/136.50  # Factorizations                       : 0
% 136.31/136.50  # NegExts                              : 0
% 136.31/136.50  # Equation resolutions                 : 0
% 136.31/136.50  # Total rewrite steps                  : 25
% 136.31/136.50  # Propositional unsat checks           : 0
% 136.31/136.50  #    Propositional check models        : 0
% 136.31/136.50  #    Propositional check unsatisfiable : 0
% 136.31/136.50  #    Propositional clauses             : 0
% 136.31/136.50  #    Propositional clauses after purity: 0
% 136.31/136.50  #    Propositional unsat core size     : 0
% 136.31/136.50  #    Propositional preprocessing time  : 0.000
% 136.31/136.50  #    Propositional encoding time       : 0.000
% 136.31/136.50  #    Propositional solver time         : 0.000
% 136.31/136.50  #    Success case prop preproc time    : 0.000
% 136.31/136.50  #    Success case prop encoding time   : 0.000
% 136.31/136.50  #    Success case prop solver time     : 0.000
% 136.31/136.50  # Current number of processed clauses  : 12
% 136.31/136.50  #    Positive orientable unit clauses  : 6
% 136.31/136.50  #    Positive unorientable unit clauses: 0
% 136.31/136.50  #    Negative unit clauses             : 0
% 136.31/136.50  #    Non-unit-clauses                  : 6
% 136.31/136.50  # Current number of unprocessed clauses: 80
% 136.31/136.50  # ...number of literals in the above   : 220
% 136.31/136.50  # Current number of archived formulas  : 0
% 136.31/136.50  # Current number of archived clauses   : 10
% 136.31/136.50  # Clause-clause subsumption calls (NU) : 15
% 136.31/136.50  # Rec. Clause-clause subsumption calls : 13
% 136.31/136.50  # Non-unit clause-clause subsumptions  : 2
% 136.31/136.50  # Unit Clause-clause subsumption calls : 0
% 136.31/136.50  # Rewrite failures with RHS unbound    : 0
% 136.31/136.50  # BW rewrite match attempts            : 11
% 136.31/136.50  # BW rewrite match successes           : 6
% 136.31/136.50  # Condensation attempts                : 0
% 136.31/136.50  # Condensation successes               : 0
% 136.31/136.50  # Termbank termtop insertions          : 1106
% 136.31/136.50  
% 136.31/136.50  # -------------------------------------------------
% 136.31/136.50  # User time                : 0.004 s
% 136.31/136.50  # System time              : 0.000 s
% 136.31/136.50  # Total time               : 0.005 s
% 136.31/136.50  # Maximum resident set size: 1724 pages
% 136.31/136.50  
% 136.31/136.50  # -------------------------------------------------
% 136.31/136.50  # User time                : 0.007 s
% 136.31/136.50  # System time              : 0.001 s
% 136.31/136.50  # Total time               : 0.008 s
% 136.31/136.50  # Maximum resident set size: 1680 pages
% 136.31/136.50  % E---3.1 exiting
% 136.31/136.50  % E---3.1 exiting
%------------------------------------------------------------------------------