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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E---3.1
% Problem  : GRP144-1 : TPTP v8.1.2. Bugfixed v1.2.1.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E %s %d THM

% Computer : n012.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:39:00 EDT 2023

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

% Comments : 
%------------------------------------------------------------------------------
cnf(prove_ax_glb3a,negated_conjecture,
    least_upper_bound(greatest_lower_bound(a,b),b) != b,
    file('/export/starexec/sandbox2/tmp/tmp.hUPeGXsFfl/E---3.1_6678.p',prove_ax_glb3a) ).

cnf(symmetry_of_glb,axiom,
    greatest_lower_bound(X1,X2) = greatest_lower_bound(X2,X1),
    file('/export/starexec/sandbox2/tmp/tmp.hUPeGXsFfl/E---3.1_6678.p',symmetry_of_glb) ).

cnf(symmetry_of_lub,axiom,
    least_upper_bound(X1,X2) = least_upper_bound(X2,X1),
    file('/export/starexec/sandbox2/tmp/tmp.hUPeGXsFfl/E---3.1_6678.p',symmetry_of_lub) ).

cnf(lub_absorbtion,axiom,
    least_upper_bound(X1,greatest_lower_bound(X1,X2)) = X1,
    file('/export/starexec/sandbox2/tmp/tmp.hUPeGXsFfl/E---3.1_6678.p',lub_absorbtion) ).

cnf(c_0_4,negated_conjecture,
    least_upper_bound(greatest_lower_bound(a,b),b) != b,
    prove_ax_glb3a ).

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

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

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

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.14  % Problem    : GRP144-1 : TPTP v8.1.2. Bugfixed v1.2.1.
% 0.07/0.16  % Command    : run_E %s %d THM
% 0.16/0.37  % Computer : n012.cluster.edu
% 0.16/0.37  % Model    : x86_64 x86_64
% 0.16/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.37  % Memory   : 8042.1875MB
% 0.16/0.37  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.16/0.37  % CPULimit   : 2400
% 0.16/0.37  % WCLimit    : 300
% 0.16/0.37  % DateTime   : Tue Oct  3 02:06:50 EDT 2023
% 0.16/0.37  % CPUTime    : 
% 0.23/0.51  Running first-order theorem proving
% 0.23/0.51  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.hUPeGXsFfl/E---3.1_6678.p
% 408.35/300.16  # Version: 3.1pre001
% 408.35/300.16  # Preprocessing class: FSMSSMSSSSSNFFN.
% 408.35/300.16  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 408.35/300.16  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 408.35/300.16  # Starting new_bool_3 with 300s (1) cores
% 408.35/300.16  # Starting new_bool_1 with 300s (1) cores
% 408.35/300.16  # Starting sh5l with 300s (1) cores
% 408.35/300.16  # new_bool_1 with pid 6869 completed with status 0
% 408.35/300.16  # Result found by new_bool_1
% 408.35/300.16  # Preprocessing class: FSMSSMSSSSSNFFN.
% 408.35/300.16  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 408.35/300.16  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 408.35/300.16  # Starting new_bool_3 with 300s (1) cores
% 408.35/300.16  # Starting new_bool_1 with 300s (1) cores
% 408.35/300.16  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 408.35/300.16  # Search class: FUUPM-FFSF22-SFFFFFNN
% 408.35/300.16  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 408.35/300.16  # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 408.35/300.16  # SAT001_MinMin_p005000_rr_RG with pid 6874 completed with status 0
% 408.35/300.16  # Result found by SAT001_MinMin_p005000_rr_RG
% 408.35/300.16  # Preprocessing class: FSMSSMSSSSSNFFN.
% 408.35/300.16  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 408.35/300.16  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 408.35/300.16  # Starting new_bool_3 with 300s (1) cores
% 408.35/300.16  # Starting new_bool_1 with 300s (1) cores
% 408.35/300.16  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 408.35/300.16  # Search class: FUUPM-FFSF22-SFFFFFNN
% 408.35/300.16  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 408.35/300.16  # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 408.35/300.16  # Preprocessing time       : 0.001 s
% 408.35/300.16  # Presaturation interreduction done
% 408.35/300.16  
% 408.35/300.16  # Proof found!
% 408.35/300.16  # SZS status Unsatisfiable
% 408.35/300.16  # SZS output start CNFRefutation
% See solution above
% 408.35/300.16  # Parsed axioms                        : 16
% 408.35/300.16  # Removed by relevancy pruning/SinE    : 2
% 408.35/300.16  # Initial clauses                      : 14
% 408.35/300.16  # Removed in clause preprocessing      : 0
% 408.35/300.16  # Initial clauses in saturation        : 14
% 408.35/300.16  # Processed clauses                    : 8
% 408.35/300.16  # ...of these trivial                  : 0
% 408.35/300.16  # ...subsumed                          : 0
% 408.35/300.16  # ...remaining for further processing  : 7
% 408.35/300.16  # Other redundant clauses eliminated   : 0
% 408.35/300.16  # Clauses deleted for lack of memory   : 0
% 408.35/300.16  # Backward-subsumed                    : 0
% 408.35/300.16  # Backward-rewritten                   : 1
% 408.35/300.16  # Generated clauses                    : 0
% 408.35/300.16  # ...of the previous two non-redundant : 1
% 408.35/300.16  # ...aggressively subsumed             : 0
% 408.35/300.16  # Contextual simplify-reflections      : 0
% 408.35/300.16  # Paramodulations                      : 0
% 408.35/300.16  # Factorizations                       : 0
% 408.35/300.16  # NegExts                              : 0
% 408.35/300.16  # Equation resolutions                 : 0
% 408.35/300.16  # Total rewrite steps                  : 3
% 408.35/300.16  # Propositional unsat checks           : 0
% 408.35/300.16  #    Propositional check models        : 0
% 408.35/300.16  #    Propositional check unsatisfiable : 0
% 408.35/300.16  #    Propositional clauses             : 0
% 408.35/300.16  #    Propositional clauses after purity: 0
% 408.35/300.16  #    Propositional unsat core size     : 0
% 408.35/300.16  #    Propositional preprocessing time  : 0.000
% 408.35/300.16  #    Propositional encoding time       : 0.000
% 408.35/300.16  #    Propositional solver time         : 0.000
% 408.35/300.16  #    Success case prop preproc time    : 0.000
% 408.35/300.16  #    Success case prop encoding time   : 0.000
% 408.35/300.16  #    Success case prop solver time     : 0.000
% 408.35/300.16  # Current number of processed clauses  : 6
% 408.35/300.16  #    Positive orientable unit clauses  : 4
% 408.35/300.16  #    Positive unorientable unit clauses: 2
% 408.35/300.16  #    Negative unit clauses             : 0
% 408.35/300.16  #    Non-unit-clauses                  : 0
% 408.35/300.16  # Current number of unprocessed clauses: 7
% 408.35/300.16  # ...number of literals in the above   : 7
% 408.35/300.16  # Current number of archived formulas  : 0
% 408.35/300.16  # Current number of archived clauses   : 1
% 408.35/300.16  # Clause-clause subsumption calls (NU) : 0
% 408.35/300.16  # Rec. Clause-clause subsumption calls : 0
% 408.35/300.16  # Non-unit clause-clause subsumptions  : 0
% 408.35/300.16  # Unit Clause-clause subsumption calls : 0
% 408.35/300.16  # Rewrite failures with RHS unbound    : 0
% 408.35/300.16  # BW rewrite match attempts            : 16
% 408.35/300.16  # BW rewrite match successes           : 14
% 408.35/300.16  # Condensation attempts                : 0
% 408.35/300.16  # Condensation successes               : 0
% 408.35/300.16  # Termbank termtop insertions          : 143
% 408.35/300.16  
% 408.35/300.16  # -------------------------------------------------
% 408.35/300.16  # User time                : 0.002 s
% 408.35/300.16  # System time              : 0.001 s
% 408.35/300.16  # Total time               : 0.003 s
% 408.35/300.16  # Maximum resident set size: 1432 pages
% 408.35/300.16  
% 408.35/300.16  # -------------------------------------------------
% 408.35/300.16  # User time                : 0.003 s
% 408.35/300.16  # System time              : 0.003 s
% 408.35/300.16  # Total time               : 0.006 s
% 408.35/300.16  # Maximum resident set size: 1676 pages
% 408.35/300.16  % E---3.1 exiting
% 408.35/300.17  % E---3.1 exiting
%------------------------------------------------------------------------------