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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E---3.1
% Problem  : GRP138-1 : TPTP v8.1.2. Bugfixed v1.2.1.
% 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:38:59 EDT 2023

% Result   : Unsatisfiable 0.17s 0.48s
% Output   : CNFRefutation 0.17s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    8
% Syntax   : Number of clauses     :   23 (  23 unt;   0 nHn;  10 RR)
%            Number of literals    :   23 (  22 equ;   3 neg)
%            Maximal clause size   :    1 (   1 avg)
%            Maximal term depth    :    4 (   1 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   :   28 (   6 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(glb_absorbtion,axiom,
    greatest_lower_bound(X1,least_upper_bound(X1,X2)) = X1,
    file('/export/starexec/sandbox/tmp/tmp.ga7RWrUh5R/E---3.1_16242.p',glb_absorbtion) ).

cnf(symmetry_of_lub,axiom,
    least_upper_bound(X1,X2) = least_upper_bound(X2,X1),
    file('/export/starexec/sandbox/tmp/tmp.ga7RWrUh5R/E---3.1_16242.p',symmetry_of_lub) ).

cnf(lub_absorbtion,axiom,
    least_upper_bound(X1,greatest_lower_bound(X1,X2)) = X1,
    file('/export/starexec/sandbox/tmp/tmp.ga7RWrUh5R/E---3.1_16242.p',lub_absorbtion) ).

cnf(associativity_of_glb,axiom,
    greatest_lower_bound(X1,greatest_lower_bound(X2,X3)) = greatest_lower_bound(greatest_lower_bound(X1,X2),X3),
    file('/export/starexec/sandbox/tmp/tmp.ga7RWrUh5R/E---3.1_16242.p',associativity_of_glb) ).

cnf(ax_glb1a_2,hypothesis,
    least_upper_bound(b,c) = b,
    file('/export/starexec/sandbox/tmp/tmp.ga7RWrUh5R/E---3.1_16242.p',ax_glb1a_2) ).

cnf(symmetry_of_glb,axiom,
    greatest_lower_bound(X1,X2) = greatest_lower_bound(X2,X1),
    file('/export/starexec/sandbox/tmp/tmp.ga7RWrUh5R/E---3.1_16242.p',symmetry_of_glb) ).

cnf(ax_glb1a_1,hypothesis,
    least_upper_bound(a,c) = a,
    file('/export/starexec/sandbox/tmp/tmp.ga7RWrUh5R/E---3.1_16242.p',ax_glb1a_1) ).

cnf(prove_ax_glb1a,negated_conjecture,
    least_upper_bound(greatest_lower_bound(a,b),c) != greatest_lower_bound(a,b),
    file('/export/starexec/sandbox/tmp/tmp.ga7RWrUh5R/E---3.1_16242.p',prove_ax_glb1a) ).

cnf(c_0_8,axiom,
    greatest_lower_bound(X1,least_upper_bound(X1,X2)) = X1,
    glb_absorbtion ).

cnf(c_0_9,axiom,
    least_upper_bound(X1,X2) = least_upper_bound(X2,X1),
    symmetry_of_lub ).

cnf(c_0_10,axiom,
    least_upper_bound(X1,greatest_lower_bound(X1,X2)) = X1,
    lub_absorbtion ).

cnf(c_0_11,axiom,
    greatest_lower_bound(X1,greatest_lower_bound(X2,X3)) = greatest_lower_bound(greatest_lower_bound(X1,X2),X3),
    associativity_of_glb ).

cnf(c_0_12,plain,
    greatest_lower_bound(X1,least_upper_bound(X2,X1)) = X1,
    inference(spm,[status(thm)],[c_0_8,c_0_9]) ).

cnf(c_0_13,hypothesis,
    least_upper_bound(b,c) = b,
    ax_glb1a_2 ).

cnf(c_0_14,axiom,
    greatest_lower_bound(X1,X2) = greatest_lower_bound(X2,X1),
    symmetry_of_glb ).

cnf(c_0_15,plain,
    least_upper_bound(greatest_lower_bound(X1,X2),greatest_lower_bound(X1,greatest_lower_bound(X2,X3))) = greatest_lower_bound(X1,X2),
    inference(spm,[status(thm)],[c_0_10,c_0_11]) ).

cnf(c_0_16,hypothesis,
    greatest_lower_bound(b,c) = c,
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14]) ).

cnf(c_0_17,hypothesis,
    least_upper_bound(a,c) = a,
    ax_glb1a_1 ).

cnf(c_0_18,negated_conjecture,
    least_upper_bound(greatest_lower_bound(a,b),c) != greatest_lower_bound(a,b),
    prove_ax_glb1a ).

cnf(c_0_19,hypothesis,
    least_upper_bound(greatest_lower_bound(X1,b),greatest_lower_bound(X1,c)) = greatest_lower_bound(X1,b),
    inference(spm,[status(thm)],[c_0_15,c_0_16]) ).

cnf(c_0_20,hypothesis,
    greatest_lower_bound(a,c) = c,
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_17]),c_0_14]) ).

cnf(c_0_21,negated_conjecture,
    least_upper_bound(c,greatest_lower_bound(a,b)) != greatest_lower_bound(a,b),
    inference(rw,[status(thm)],[c_0_18,c_0_9]) ).

cnf(c_0_22,hypothesis,
    $false,
    inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_9]),c_0_21]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.11  % Problem    : GRP138-1 : TPTP v8.1.2. Bugfixed v1.2.1.
% 0.02/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 02:54:07 EDT 2023
% 0.12/0.33  % CPUTime    : 
% 0.17/0.44  Running first-order theorem proving
% 0.17/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.ga7RWrUh5R/E---3.1_16242.p
% 0.17/0.48  # Version: 3.1pre001
% 0.17/0.48  # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.17/0.48  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.48  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.17/0.48  # Starting new_bool_3 with 300s (1) cores
% 0.17/0.48  # Starting new_bool_1 with 300s (1) cores
% 0.17/0.48  # Starting sh5l with 300s (1) cores
% 0.17/0.48  # new_bool_1 with pid 16322 completed with status 0
% 0.17/0.48  # Result found by new_bool_1
% 0.17/0.48  # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.17/0.48  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.48  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.17/0.48  # Starting new_bool_3 with 300s (1) cores
% 0.17/0.48  # Starting new_bool_1 with 300s (1) cores
% 0.17/0.48  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.17/0.48  # Search class: FUUPM-FFSF22-SFFFFFNN
% 0.17/0.48  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.17/0.48  # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.17/0.48  # SAT001_MinMin_p005000_rr_RG with pid 16327 completed with status 0
% 0.17/0.48  # Result found by SAT001_MinMin_p005000_rr_RG
% 0.17/0.48  # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.17/0.48  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.48  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.17/0.48  # Starting new_bool_3 with 300s (1) cores
% 0.17/0.48  # Starting new_bool_1 with 300s (1) cores
% 0.17/0.48  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.17/0.48  # Search class: FUUPM-FFSF22-SFFFFFNN
% 0.17/0.48  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.17/0.48  # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.17/0.48  # Preprocessing time       : 0.001 s
% 0.17/0.48  # Presaturation interreduction done
% 0.17/0.48  
% 0.17/0.48  # Proof found!
% 0.17/0.48  # SZS status Unsatisfiable
% 0.17/0.48  # SZS output start CNFRefutation
% See solution above
% 0.17/0.48  # Parsed axioms                        : 18
% 0.17/0.48  # Removed by relevancy pruning/SinE    : 2
% 0.17/0.48  # Initial clauses                      : 16
% 0.17/0.48  # Removed in clause preprocessing      : 0
% 0.17/0.48  # Initial clauses in saturation        : 16
% 0.17/0.48  # Processed clauses                    : 265
% 0.17/0.48  # ...of these trivial                  : 90
% 0.17/0.48  # ...subsumed                          : 72
% 0.17/0.48  # ...remaining for further processing  : 103
% 0.17/0.48  # Other redundant clauses eliminated   : 0
% 0.17/0.48  # Clauses deleted for lack of memory   : 0
% 0.17/0.48  # Backward-subsumed                    : 0
% 0.17/0.48  # Backward-rewritten                   : 4
% 0.17/0.48  # Generated clauses                    : 3084
% 0.17/0.48  # ...of the previous two non-redundant : 1496
% 0.17/0.48  # ...aggressively subsumed             : 0
% 0.17/0.48  # Contextual simplify-reflections      : 0
% 0.17/0.48  # Paramodulations                      : 3084
% 0.17/0.48  # Factorizations                       : 0
% 0.17/0.48  # NegExts                              : 0
% 0.17/0.48  # Equation resolutions                 : 0
% 0.17/0.48  # Total rewrite steps                  : 3594
% 0.17/0.48  # Propositional unsat checks           : 0
% 0.17/0.48  #    Propositional check models        : 0
% 0.17/0.48  #    Propositional check unsatisfiable : 0
% 0.17/0.48  #    Propositional clauses             : 0
% 0.17/0.48  #    Propositional clauses after purity: 0
% 0.17/0.48  #    Propositional unsat core size     : 0
% 0.17/0.48  #    Propositional preprocessing time  : 0.000
% 0.17/0.48  #    Propositional encoding time       : 0.000
% 0.17/0.48  #    Propositional solver time         : 0.000
% 0.17/0.48  #    Success case prop preproc time    : 0.000
% 0.17/0.48  #    Success case prop encoding time   : 0.000
% 0.17/0.48  #    Success case prop solver time     : 0.000
% 0.17/0.48  # Current number of processed clauses  : 83
% 0.17/0.48  #    Positive orientable unit clauses  : 76
% 0.17/0.48  #    Positive unorientable unit clauses: 6
% 0.17/0.48  #    Negative unit clauses             : 1
% 0.17/0.48  #    Non-unit-clauses                  : 0
% 0.17/0.48  # Current number of unprocessed clauses: 1248
% 0.17/0.48  # ...number of literals in the above   : 1248
% 0.17/0.48  # Current number of archived formulas  : 0
% 0.17/0.48  # Current number of archived clauses   : 20
% 0.17/0.48  # Clause-clause subsumption calls (NU) : 0
% 0.17/0.48  # Rec. Clause-clause subsumption calls : 0
% 0.17/0.48  # Non-unit clause-clause subsumptions  : 0
% 0.17/0.48  # Unit Clause-clause subsumption calls : 16
% 0.17/0.48  # Rewrite failures with RHS unbound    : 0
% 0.17/0.48  # BW rewrite match attempts            : 215
% 0.17/0.48  # BW rewrite match successes           : 158
% 0.17/0.48  # Condensation attempts                : 0
% 0.17/0.48  # Condensation successes               : 0
% 0.17/0.48  # Termbank termtop insertions          : 24121
% 0.17/0.48  
% 0.17/0.48  # -------------------------------------------------
% 0.17/0.48  # User time                : 0.023 s
% 0.17/0.48  # System time              : 0.001 s
% 0.17/0.48  # Total time               : 0.024 s
% 0.17/0.48  # Maximum resident set size: 1620 pages
% 0.17/0.48  
% 0.17/0.48  # -------------------------------------------------
% 0.17/0.48  # User time                : 0.025 s
% 0.17/0.48  # System time              : 0.002 s
% 0.17/0.48  # Total time               : 0.026 s
% 0.17/0.48  # Maximum resident set size: 1676 pages
% 0.17/0.48  % E---3.1 exiting
% 0.17/0.48  % E---3.1 exiting
%------------------------------------------------------------------------------