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

View Problem - Process Solution

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

% Computer : n032.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   : Unsatisfiable 0.17s 0.43s
% Output   : CNFRefutation 0.17s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :    5
% Syntax   : Number of clauses     :   15 (  15 unt;   0 nHn;  10 RR)
%            Number of literals    :   15 (  14 equ;   3 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;   3 con; 0-2 aty)
%            Number of variables   :   11 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(ax_lub1a_1,hypothesis,
    least_upper_bound(a,c) = c,
    file('/export/starexec/sandbox/tmp/tmp.MeHVgVUvFS/E---3.1_16537.p',ax_lub1a_1) ).

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

cnf(prove_ax_lub1a,negated_conjecture,
    least_upper_bound(least_upper_bound(a,b),c) != c,
    file('/export/starexec/sandbox/tmp/tmp.MeHVgVUvFS/E---3.1_16537.p',prove_ax_lub1a) ).

cnf(associativity_of_lub,axiom,
    least_upper_bound(X1,least_upper_bound(X2,X3)) = least_upper_bound(least_upper_bound(X1,X2),X3),
    file('/export/starexec/sandbox/tmp/tmp.MeHVgVUvFS/E---3.1_16537.p',associativity_of_lub) ).

cnf(ax_lub1a_2,hypothesis,
    least_upper_bound(b,c) = c,
    file('/export/starexec/sandbox/tmp/tmp.MeHVgVUvFS/E---3.1_16537.p',ax_lub1a_2) ).

cnf(c_0_5,hypothesis,
    least_upper_bound(a,c) = c,
    ax_lub1a_1 ).

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

cnf(c_0_7,negated_conjecture,
    least_upper_bound(least_upper_bound(a,b),c) != c,
    prove_ax_lub1a ).

cnf(c_0_8,axiom,
    least_upper_bound(X1,least_upper_bound(X2,X3)) = least_upper_bound(least_upper_bound(X1,X2),X3),
    associativity_of_lub ).

cnf(c_0_9,hypothesis,
    least_upper_bound(c,a) = c,
    inference(rw,[status(thm)],[c_0_5,c_0_6]) ).

cnf(c_0_10,hypothesis,
    least_upper_bound(b,c) = c,
    ax_lub1a_2 ).

cnf(c_0_11,negated_conjecture,
    least_upper_bound(c,least_upper_bound(a,b)) != c,
    inference(rw,[status(thm)],[c_0_7,c_0_6]) ).

cnf(c_0_12,hypothesis,
    least_upper_bound(c,least_upper_bound(a,X1)) = least_upper_bound(c,X1),
    inference(spm,[status(thm)],[c_0_8,c_0_9]) ).

cnf(c_0_13,hypothesis,
    least_upper_bound(c,b) = c,
    inference(rw,[status(thm)],[c_0_10,c_0_6]) ).

cnf(c_0_14,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_11,c_0_12]),c_0_13])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11  % Problem    : GRP146-1 : TPTP v8.1.2. Bugfixed v1.2.1.
% 0.11/0.12  % Command    : run_E %s %d THM
% 0.12/0.32  % Computer : n032.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:39:35 EDT 2023
% 0.12/0.32  % CPUTime    : 
% 0.17/0.42  Running first-order theorem proving
% 0.17/0.42  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.MeHVgVUvFS/E---3.1_16537.p
% 0.17/0.43  # Version: 3.1pre001
% 0.17/0.43  # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.17/0.43  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.43  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.17/0.43  # Starting new_bool_3 with 300s (1) cores
% 0.17/0.43  # Starting new_bool_1 with 300s (1) cores
% 0.17/0.43  # Starting sh5l with 300s (1) cores
% 0.17/0.43  # new_bool_1 with pid 16617 completed with status 0
% 0.17/0.43  # Result found by new_bool_1
% 0.17/0.43  # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.17/0.43  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.43  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.17/0.43  # Starting new_bool_3 with 300s (1) cores
% 0.17/0.43  # Starting new_bool_1 with 300s (1) cores
% 0.17/0.43  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.17/0.43  # Search class: FUUPM-FFSF22-SFFFFFNN
% 0.17/0.43  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.17/0.43  # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.17/0.43  # SAT001_MinMin_p005000_rr_RG with pid 16622 completed with status 0
% 0.17/0.43  # Result found by SAT001_MinMin_p005000_rr_RG
% 0.17/0.43  # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.17/0.43  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.43  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.17/0.43  # Starting new_bool_3 with 300s (1) cores
% 0.17/0.43  # Starting new_bool_1 with 300s (1) cores
% 0.17/0.43  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.17/0.43  # Search class: FUUPM-FFSF22-SFFFFFNN
% 0.17/0.43  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.17/0.43  # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.17/0.43  # Preprocessing time       : 0.001 s
% 0.17/0.43  # Presaturation interreduction done
% 0.17/0.43  
% 0.17/0.43  # Proof found!
% 0.17/0.43  # SZS status Unsatisfiable
% 0.17/0.43  # SZS output start CNFRefutation
% See solution above
% 0.17/0.43  # Parsed axioms                        : 18
% 0.17/0.43  # Removed by relevancy pruning/SinE    : 2
% 0.17/0.43  # Initial clauses                      : 16
% 0.17/0.43  # Removed in clause preprocessing      : 0
% 0.17/0.43  # Initial clauses in saturation        : 16
% 0.17/0.43  # Processed clauses                    : 38
% 0.17/0.43  # ...of these trivial                  : 0
% 0.17/0.43  # ...subsumed                          : 0
% 0.17/0.43  # ...remaining for further processing  : 38
% 0.17/0.43  # Other redundant clauses eliminated   : 0
% 0.17/0.43  # Clauses deleted for lack of memory   : 0
% 0.17/0.43  # Backward-subsumed                    : 0
% 0.17/0.43  # Backward-rewritten                   : 4
% 0.17/0.43  # Generated clauses                    : 80
% 0.17/0.43  # ...of the previous two non-redundant : 51
% 0.17/0.43  # ...aggressively subsumed             : 0
% 0.17/0.43  # Contextual simplify-reflections      : 0
% 0.17/0.43  # Paramodulations                      : 80
% 0.17/0.43  # Factorizations                       : 0
% 0.17/0.43  # NegExts                              : 0
% 0.17/0.43  # Equation resolutions                 : 0
% 0.17/0.43  # Total rewrite steps                  : 58
% 0.17/0.43  # Propositional unsat checks           : 0
% 0.17/0.43  #    Propositional check models        : 0
% 0.17/0.43  #    Propositional check unsatisfiable : 0
% 0.17/0.43  #    Propositional clauses             : 0
% 0.17/0.43  #    Propositional clauses after purity: 0
% 0.17/0.43  #    Propositional unsat core size     : 0
% 0.17/0.43  #    Propositional preprocessing time  : 0.000
% 0.17/0.43  #    Propositional encoding time       : 0.000
% 0.17/0.43  #    Propositional solver time         : 0.000
% 0.17/0.43  #    Success case prop preproc time    : 0.000
% 0.17/0.43  #    Success case prop encoding time   : 0.000
% 0.17/0.43  #    Success case prop solver time     : 0.000
% 0.17/0.43  # Current number of processed clauses  : 18
% 0.17/0.43  #    Positive orientable unit clauses  : 16
% 0.17/0.43  #    Positive unorientable unit clauses: 2
% 0.17/0.43  #    Negative unit clauses             : 0
% 0.17/0.43  #    Non-unit-clauses                  : 0
% 0.17/0.43  # Current number of unprocessed clauses: 45
% 0.17/0.43  # ...number of literals in the above   : 45
% 0.17/0.43  # Current number of archived formulas  : 0
% 0.17/0.43  # Current number of archived clauses   : 20
% 0.17/0.43  # Clause-clause subsumption calls (NU) : 0
% 0.17/0.43  # Rec. Clause-clause subsumption calls : 0
% 0.17/0.43  # Non-unit clause-clause subsumptions  : 0
% 0.17/0.43  # Unit Clause-clause subsumption calls : 1
% 0.17/0.43  # Rewrite failures with RHS unbound    : 0
% 0.17/0.43  # BW rewrite match attempts            : 43
% 0.17/0.43  # BW rewrite match successes           : 33
% 0.17/0.43  # Condensation attempts                : 0
% 0.17/0.43  # Condensation successes               : 0
% 0.17/0.43  # Termbank termtop insertions          : 788
% 0.17/0.43  
% 0.17/0.43  # -------------------------------------------------
% 0.17/0.43  # User time                : 0.002 s
% 0.17/0.43  # System time              : 0.001 s
% 0.17/0.43  # Total time               : 0.003 s
% 0.17/0.43  # Maximum resident set size: 1620 pages
% 0.17/0.43  
% 0.17/0.43  # -------------------------------------------------
% 0.17/0.43  # User time                : 0.002 s
% 0.17/0.43  # System time              : 0.003 s
% 0.17/0.43  # Total time               : 0.005 s
% 0.17/0.43  # Maximum resident set size: 1676 pages
% 0.17/0.43  % E---3.1 exiting
% 0.17/0.43  % E---3.1 exiting
%------------------------------------------------------------------------------