TSTP Solution File: GRP158-1 by E---3.1.00

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E---3.1.00
% Problem  : GRP158-1 : TPTP v8.1.2. Bugfixed v1.2.1.
% 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 : 300s
% WCLimit  : 300s
% DateTime : Sat May  4 07:49:58 EDT 2024

% Result   : Unsatisfiable 0.18s 0.46s
% Output   : CNFRefutation 0.18s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    3
%            Number of leaves      :    3
% Syntax   : Number of clauses     :    8 (   8 unt;   0 nHn;   6 RR)
%            Number of literals    :    8 (   7 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    :    5 (   5 usr;   3 con; 0-2 aty)
%            Number of variables   :    6 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(prove_ax_mono2b,negated_conjecture,
    greatest_lower_bound(multiply(c,a),multiply(c,b)) != multiply(c,a),
    file('/export/starexec/sandbox/tmp/tmp.3n0sBCxgcU/E---3.1_9497.p',prove_ax_mono2b) ).

cnf(monotony_glb1,axiom,
    multiply(X1,greatest_lower_bound(X2,X3)) = greatest_lower_bound(multiply(X1,X2),multiply(X1,X3)),
    file('/export/starexec/sandbox/tmp/tmp.3n0sBCxgcU/E---3.1_9497.p',monotony_glb1) ).

cnf(ax_mono2b_1,hypothesis,
    greatest_lower_bound(a,b) = a,
    file('/export/starexec/sandbox/tmp/tmp.3n0sBCxgcU/E---3.1_9497.p',ax_mono2b_1) ).

cnf(c_0_3,negated_conjecture,
    greatest_lower_bound(multiply(c,a),multiply(c,b)) != multiply(c,a),
    inference(fof_simplification,[status(thm)],[prove_ax_mono2b]) ).

cnf(c_0_4,negated_conjecture,
    greatest_lower_bound(multiply(c,a),multiply(c,b)) != multiply(c,a),
    c_0_3 ).

cnf(c_0_5,axiom,
    multiply(X1,greatest_lower_bound(X2,X3)) = greatest_lower_bound(multiply(X1,X2),multiply(X1,X3)),
    monotony_glb1 ).

cnf(c_0_6,hypothesis,
    greatest_lower_bound(a,b) = a,
    ax_mono2b_1 ).

cnf(c_0_7,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_4,c_0_5]),c_0_6])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11  % Problem    : GRP158-1 : TPTP v8.1.2. Bugfixed v1.2.1.
% 0.06/0.12  % Command    : run_E %s %d THM
% 0.12/0.33  % Computer : n027.cluster.edu
% 0.12/0.33  % Model    : x86_64 x86_64
% 0.12/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33  % Memory   : 8042.1875MB
% 0.12/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33  % CPULimit   : 300
% 0.12/0.33  % WCLimit    : 300
% 0.12/0.33  % DateTime   : Fri May  3 15:53:53 EDT 2024
% 0.12/0.33  % CPUTime    : 
% 0.18/0.45  Running first-order theorem proving
% 0.18/0.45  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.3n0sBCxgcU/E---3.1_9497.p
% 0.18/0.46  # Version: 3.1.0
% 0.18/0.46  # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.18/0.46  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.46  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.18/0.46  # Starting new_bool_3 with 300s (1) cores
% 0.18/0.46  # Starting new_bool_1 with 300s (1) cores
% 0.18/0.46  # Starting sh5l with 300s (1) cores
% 0.18/0.46  # new_bool_1 with pid 9637 completed with status 0
% 0.18/0.46  # Result found by new_bool_1
% 0.18/0.46  # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.18/0.46  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.46  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.18/0.46  # Starting new_bool_3 with 300s (1) cores
% 0.18/0.46  # Starting new_bool_1 with 300s (1) cores
% 0.18/0.46  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.18/0.46  # Search class: FUUPM-FFSF22-SFFFFFNN
% 0.18/0.46  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.18/0.46  # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.18/0.46  # SAT001_MinMin_p005000_rr_RG with pid 9645 completed with status 0
% 0.18/0.46  # Result found by SAT001_MinMin_p005000_rr_RG
% 0.18/0.46  # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.18/0.46  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.46  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.18/0.46  # Starting new_bool_3 with 300s (1) cores
% 0.18/0.46  # Starting new_bool_1 with 300s (1) cores
% 0.18/0.46  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.18/0.46  # Search class: FUUPM-FFSF22-SFFFFFNN
% 0.18/0.46  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.18/0.46  # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.18/0.46  # Preprocessing time       : 0.001 s
% 0.18/0.46  # Presaturation interreduction done
% 0.18/0.46  
% 0.18/0.46  # Proof found!
% 0.18/0.46  # SZS status Unsatisfiable
% 0.18/0.46  # SZS output start CNFRefutation
% See solution above
% 0.18/0.46  # Parsed axioms                        : 17
% 0.18/0.46  # Removed by relevancy pruning/SinE    : 2
% 0.18/0.46  # Initial clauses                      : 15
% 0.18/0.46  # Removed in clause preprocessing      : 0
% 0.18/0.46  # Initial clauses in saturation        : 15
% 0.18/0.46  # Processed clauses                    : 12
% 0.18/0.46  # ...of these trivial                  : 0
% 0.18/0.46  # ...subsumed                          : 0
% 0.18/0.46  # ...remaining for further processing  : 12
% 0.18/0.46  # Other redundant clauses eliminated   : 0
% 0.18/0.46  # Clauses deleted for lack of memory   : 0
% 0.18/0.46  # Backward-subsumed                    : 0
% 0.18/0.46  # Backward-rewritten                   : 1
% 0.18/0.46  # Generated clauses                    : 0
% 0.18/0.46  # ...of the previous two non-redundant : 0
% 0.18/0.46  # ...aggressively subsumed             : 0
% 0.18/0.46  # Contextual simplify-reflections      : 0
% 0.18/0.46  # Paramodulations                      : 0
% 0.18/0.46  # Factorizations                       : 0
% 0.18/0.46  # NegExts                              : 0
% 0.18/0.46  # Equation resolutions                 : 0
% 0.18/0.46  # Disequality decompositions           : 0
% 0.18/0.46  # Total rewrite steps                  : 2
% 0.18/0.46  # ...of those cached                   : 0
% 0.18/0.46  # Propositional unsat checks           : 0
% 0.18/0.46  #    Propositional check models        : 0
% 0.18/0.46  #    Propositional check unsatisfiable : 0
% 0.18/0.46  #    Propositional clauses             : 0
% 0.18/0.46  #    Propositional clauses after purity: 0
% 0.18/0.46  #    Propositional unsat core size     : 0
% 0.18/0.46  #    Propositional preprocessing time  : 0.000
% 0.18/0.46  #    Propositional encoding time       : 0.000
% 0.18/0.46  #    Propositional solver time         : 0.000
% 0.18/0.46  #    Success case prop preproc time    : 0.000
% 0.18/0.46  #    Success case prop encoding time   : 0.000
% 0.18/0.46  #    Success case prop solver time     : 0.000
% 0.18/0.46  # Current number of processed clauses  : 11
% 0.18/0.46  #    Positive orientable unit clauses  : 9
% 0.18/0.46  #    Positive unorientable unit clauses: 2
% 0.18/0.46  #    Negative unit clauses             : 0
% 0.18/0.46  #    Non-unit-clauses                  : 0
% 0.18/0.46  # Current number of unprocessed clauses: 3
% 0.18/0.46  # ...number of literals in the above   : 3
% 0.18/0.46  # Current number of archived formulas  : 0
% 0.18/0.46  # Current number of archived clauses   : 1
% 0.18/0.46  # Clause-clause subsumption calls (NU) : 0
% 0.18/0.46  # Rec. Clause-clause subsumption calls : 0
% 0.18/0.46  # Non-unit clause-clause subsumptions  : 0
% 0.18/0.46  # Unit Clause-clause subsumption calls : 0
% 0.18/0.46  # Rewrite failures with RHS unbound    : 0
% 0.18/0.46  # BW rewrite match attempts            : 11
% 0.18/0.46  # BW rewrite match successes           : 9
% 0.18/0.46  # Condensation attempts                : 0
% 0.18/0.46  # Condensation successes               : 0
% 0.18/0.46  # Termbank termtop insertions          : 196
% 0.18/0.46  # Search garbage collected termcells   : 8
% 0.18/0.46  
% 0.18/0.46  # -------------------------------------------------
% 0.18/0.46  # User time                : 0.002 s
% 0.18/0.46  # System time              : 0.000 s
% 0.18/0.46  # Total time               : 0.002 s
% 0.18/0.46  # Maximum resident set size: 1628 pages
% 0.18/0.46  
% 0.18/0.46  # -------------------------------------------------
% 0.18/0.46  # User time                : 0.003 s
% 0.18/0.46  # System time              : 0.003 s
% 0.18/0.46  # Total time               : 0.006 s
% 0.18/0.46  # Maximum resident set size: 1688 pages
% 0.18/0.46  % E---3.1 exiting
% 0.18/0.46  % E exiting
%------------------------------------------------------------------------------