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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E---3.1
% Problem  : GRP549-1 : TPTP v8.1.2. Released v2.6.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E %s %d THM

% Computer : n009.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:42:06 EDT 2023

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

% Comments : 
%------------------------------------------------------------------------------
cnf(prove_these_axioms_1,negated_conjecture,
    multiply(inverse(a1),a1) != multiply(inverse(b1),b1),
    file('/export/starexec/sandbox/tmp/tmp.ImsZHzs7C4/E---3.1_7090.p',prove_these_axioms_1) ).

cnf(inverse,axiom,
    inverse(X1) = divide(identity,X1),
    file('/export/starexec/sandbox/tmp/tmp.ImsZHzs7C4/E---3.1_7090.p',inverse) ).

cnf(multiply,axiom,
    multiply(X1,X2) = divide(X1,divide(identity,X2)),
    file('/export/starexec/sandbox/tmp/tmp.ImsZHzs7C4/E---3.1_7090.p',multiply) ).

cnf(identity,axiom,
    identity = divide(X1,X1),
    file('/export/starexec/sandbox/tmp/tmp.ImsZHzs7C4/E---3.1_7090.p',identity) ).

cnf(c_0_4,negated_conjecture,
    multiply(inverse(a1),a1) != multiply(inverse(b1),b1),
    prove_these_axioms_1 ).

cnf(c_0_5,axiom,
    inverse(X1) = divide(identity,X1),
    inverse ).

cnf(c_0_6,axiom,
    multiply(X1,X2) = divide(X1,divide(identity,X2)),
    multiply ).

cnf(c_0_7,negated_conjecture,
    divide(divide(identity,b1),divide(identity,b1)) != divide(divide(identity,a1),divide(identity,a1)),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_4,c_0_5]),c_0_5]),c_0_6]),c_0_6]) ).

cnf(c_0_8,axiom,
    identity = divide(X1,X1),
    identity ).

cnf(c_0_9,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_7,c_0_8]),c_0_8])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem    : GRP549-1 : TPTP v8.1.2. Released v2.6.0.
% 0.07/0.14  % Command    : run_E %s %d THM
% 0.14/0.34  % Computer : n009.cluster.edu
% 0.14/0.34  % Model    : x86_64 x86_64
% 0.14/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34  % Memory   : 8042.1875MB
% 0.14/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34  % CPULimit   : 2400
% 0.14/0.34  % WCLimit    : 300
% 0.14/0.34  % DateTime   : Tue Oct  3 02:52:59 EDT 2023
% 0.14/0.34  % CPUTime    : 
% 0.20/0.47  Running first-order theorem proving
% 0.20/0.47  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.ImsZHzs7C4/E---3.1_7090.p
% 0.20/0.48  # Version: 3.1pre001
% 0.20/0.48  # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.20/0.48  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.48  # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.20/0.48  # Starting new_bool_3 with 300s (1) cores
% 0.20/0.48  # Starting new_bool_1 with 300s (1) cores
% 0.20/0.48  # Starting sh5l with 300s (1) cores
% 0.20/0.48  # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 7171 completed with status 0
% 0.20/0.48  # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.20/0.48  # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.20/0.48  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.48  # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.20/0.48  # No SInE strategy applied
% 0.20/0.48  # Search class: FUUPS-FFSF22-MFFFFFNN
% 0.20/0.48  # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.48  # Starting G-E--_208_C18_F1_AE_CS_SP_S0Y with 811s (1) cores
% 0.20/0.48  # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.20/0.48  # Starting new_bool_3 with 136s (1) cores
% 0.20/0.48  # Starting new_bool_1 with 136s (1) cores
% 0.20/0.48  # Starting sh5l with 136s (1) cores
% 0.20/0.48  # G-E--_208_C18_F1_AE_CS_SP_S0Y with pid 7176 completed with status 0
% 0.20/0.48  # Result found by G-E--_208_C18_F1_AE_CS_SP_S0Y
% 0.20/0.48  # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.20/0.48  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.48  # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.20/0.48  # No SInE strategy applied
% 0.20/0.48  # Search class: FUUPS-FFSF22-MFFFFFNN
% 0.20/0.48  # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.48  # Starting G-E--_208_C18_F1_AE_CS_SP_S0Y with 811s (1) cores
% 0.20/0.48  # Preprocessing time       : 0.001 s
% 0.20/0.48  
% 0.20/0.48  # Proof found!
% 0.20/0.48  # SZS status Unsatisfiable
% 0.20/0.48  # SZS output start CNFRefutation
% See solution above
% 0.20/0.48  # Parsed axioms                        : 5
% 0.20/0.48  # Removed by relevancy pruning/SinE    : 0
% 0.20/0.48  # Initial clauses                      : 5
% 0.20/0.48  # Removed in clause preprocessing      : 2
% 0.20/0.48  # Initial clauses in saturation        : 3
% 0.20/0.48  # Processed clauses                    : 2
% 0.20/0.48  # ...of these trivial                  : 0
% 0.20/0.48  # ...subsumed                          : 0
% 0.20/0.48  # ...remaining for further processing  : 1
% 0.20/0.48  # Other redundant clauses eliminated   : 0
% 0.20/0.48  # Clauses deleted for lack of memory   : 0
% 0.20/0.48  # Backward-subsumed                    : 0
% 0.20/0.48  # Backward-rewritten                   : 0
% 0.20/0.48  # Generated clauses                    : 0
% 0.20/0.48  # ...of the previous two non-redundant : 0
% 0.20/0.48  # ...aggressively subsumed             : 0
% 0.20/0.48  # Contextual simplify-reflections      : 0
% 0.20/0.48  # Paramodulations                      : 0
% 0.20/0.48  # Factorizations                       : 0
% 0.20/0.48  # NegExts                              : 0
% 0.20/0.48  # Equation resolutions                 : 0
% 0.20/0.48  # Total rewrite steps                  : 2
% 0.20/0.48  # Propositional unsat checks           : 0
% 0.20/0.48  #    Propositional check models        : 0
% 0.20/0.48  #    Propositional check unsatisfiable : 0
% 0.20/0.48  #    Propositional clauses             : 0
% 0.20/0.48  #    Propositional clauses after purity: 0
% 0.20/0.48  #    Propositional unsat core size     : 0
% 0.20/0.48  #    Propositional preprocessing time  : 0.000
% 0.20/0.48  #    Propositional encoding time       : 0.000
% 0.20/0.48  #    Propositional solver time         : 0.000
% 0.20/0.48  #    Success case prop preproc time    : 0.000
% 0.20/0.48  #    Success case prop encoding time   : 0.000
% 0.20/0.48  #    Success case prop solver time     : 0.000
% 0.20/0.48  # Current number of processed clauses  : 1
% 0.20/0.48  #    Positive orientable unit clauses  : 1
% 0.20/0.48  #    Positive unorientable unit clauses: 0
% 0.20/0.48  #    Negative unit clauses             : 0
% 0.20/0.48  #    Non-unit-clauses                  : 0
% 0.20/0.48  # Current number of unprocessed clauses: 1
% 0.20/0.48  # ...number of literals in the above   : 1
% 0.20/0.48  # Current number of archived formulas  : 0
% 0.20/0.48  # Current number of archived clauses   : 2
% 0.20/0.48  # Clause-clause subsumption calls (NU) : 0
% 0.20/0.48  # Rec. Clause-clause subsumption calls : 0
% 0.20/0.48  # Non-unit clause-clause subsumptions  : 0
% 0.20/0.48  # Unit Clause-clause subsumption calls : 0
% 0.20/0.48  # Rewrite failures with RHS unbound    : 0
% 0.20/0.48  # BW rewrite match attempts            : 0
% 0.20/0.48  # BW rewrite match successes           : 0
% 0.20/0.48  # Condensation attempts                : 0
% 0.20/0.48  # Condensation successes               : 0
% 0.20/0.48  # Termbank termtop insertions          : 65
% 0.20/0.48  
% 0.20/0.48  # -------------------------------------------------
% 0.20/0.48  # User time                : 0.002 s
% 0.20/0.48  # System time              : 0.001 s
% 0.20/0.48  # Total time               : 0.003 s
% 0.20/0.48  # Maximum resident set size: 1568 pages
% 0.20/0.48  
% 0.20/0.48  # -------------------------------------------------
% 0.20/0.48  # User time                : 0.007 s
% 0.20/0.48  # System time              : 0.005 s
% 0.20/0.48  # Total time               : 0.012 s
% 0.20/0.48  # Maximum resident set size: 1668 pages
% 0.20/0.48  % E---3.1 exiting
% 0.20/0.48  % E---3.1 exiting
%------------------------------------------------------------------------------