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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E---3.1.00
% Problem  : ALG350-1 : TPTP v8.2.0. Released v4.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E %s %d THM

% Computer : n008.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 : Mon May 20 18:06:09 EDT 2024

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

% Comments : 
%------------------------------------------------------------------------------
cnf(cls_Y_0,axiom,
    ( c_HOL_Oord__class_Oless(X1,v_Y____,tc_RealDef_Oreal)
    | ~ hBOOL(hAPP(v_P,X1)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Y_0) ).

cnf(cls_conjecture_1,negated_conjecture,
    ~ c_lessequals(v_xa,v_Y____,tc_RealDef_Oreal),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_1) ).

cnf(cls_real__less__def_0,axiom,
    ( c_lessequals(X1,X2,tc_RealDef_Oreal)
    | ~ c_HOL_Oord__class_Oless(X1,X2,tc_RealDef_Oreal) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_real__less__def_0) ).

cnf(cls_conjecture_0,negated_conjecture,
    hBOOL(hAPP(v_P,v_xa)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_0) ).

cnf(c_0_4,plain,
    ( c_HOL_Oord__class_Oless(X1,v_Y____,tc_RealDef_Oreal)
    | ~ hBOOL(hAPP(v_P,X1)) ),
    inference(fof_simplification,[status(thm)],[cls_Y_0]) ).

cnf(c_0_5,negated_conjecture,
    ~ c_lessequals(v_xa,v_Y____,tc_RealDef_Oreal),
    inference(fof_simplification,[status(thm)],[cls_conjecture_1]) ).

cnf(c_0_6,plain,
    ( c_lessequals(X1,X2,tc_RealDef_Oreal)
    | ~ c_HOL_Oord__class_Oless(X1,X2,tc_RealDef_Oreal) ),
    inference(fof_simplification,[status(thm)],[cls_real__less__def_0]) ).

cnf(c_0_7,plain,
    ( c_HOL_Oord__class_Oless(X1,v_Y____,tc_RealDef_Oreal)
    | ~ hBOOL(hAPP(v_P,X1)) ),
    c_0_4 ).

cnf(c_0_8,negated_conjecture,
    hBOOL(hAPP(v_P,v_xa)),
    cls_conjecture_0 ).

cnf(c_0_9,negated_conjecture,
    ~ c_lessequals(v_xa,v_Y____,tc_RealDef_Oreal),
    c_0_5 ).

cnf(c_0_10,plain,
    ( c_lessequals(X1,X2,tc_RealDef_Oreal)
    | ~ c_HOL_Oord__class_Oless(X1,X2,tc_RealDef_Oreal) ),
    c_0_6 ).

cnf(c_0_11,negated_conjecture,
    c_HOL_Oord__class_Oless(v_xa,v_Y____,tc_RealDef_Oreal),
    inference(spm,[status(thm)],[c_0_7,c_0_8]) ).

cnf(c_0_12,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_11])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem    : ALG350-1 : TPTP v8.2.0. Released v4.1.0.
% 0.07/0.14  % Command    : run_E %s %d THM
% 0.13/0.35  % Computer : n008.cluster.edu
% 0.13/0.35  % Model    : x86_64 x86_64
% 0.13/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35  % Memory   : 8042.1875MB
% 0.13/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35  % CPULimit   : 300
% 0.13/0.35  % WCLimit    : 300
% 0.13/0.35  % DateTime   : Sat May 18 23:30:53 EDT 2024
% 0.13/0.35  % CPUTime    : 
% 0.21/0.48  Running first-order theorem proving
% 0.21/0.48  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/benchmark/theBenchmark.p
% 0.21/0.51  # Version: 3.1.0
% 0.21/0.51  # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.21/0.51  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.51  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.21/0.51  # Starting new_bool_3 with 300s (1) cores
% 0.21/0.51  # Starting new_bool_1 with 300s (1) cores
% 0.21/0.51  # Starting sh5l with 300s (1) cores
% 0.21/0.51  # new_bool_3 with pid 4684 completed with status 0
% 0.21/0.51  # Result found by new_bool_3
% 0.21/0.51  # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.21/0.51  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.51  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.21/0.51  # Starting new_bool_3 with 300s (1) cores
% 0.21/0.51  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/0.51  # Search class: FGHSF-FFMF32-SFFFFFNN
% 0.21/0.51  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.51  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.21/0.51  # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 4687 completed with status 0
% 0.21/0.51  # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.21/0.51  # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.21/0.51  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.51  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.21/0.51  # Starting new_bool_3 with 300s (1) cores
% 0.21/0.51  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/0.51  # Search class: FGHSF-FFMF32-SFFFFFNN
% 0.21/0.51  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.51  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 0.21/0.51  # Preprocessing time       : 0.003 s
% 0.21/0.51  # Presaturation interreduction done
% 0.21/0.51  
% 0.21/0.51  # Proof found!
% 0.21/0.51  # SZS status Unsatisfiable
% 0.21/0.51  # SZS output start CNFRefutation
% See solution above
% 0.21/0.51  # Parsed axioms                        : 380
% 0.21/0.51  # Removed by relevancy pruning/SinE    : 351
% 0.21/0.51  # Initial clauses                      : 29
% 0.21/0.51  # Removed in clause preprocessing      : 0
% 0.21/0.51  # Initial clauses in saturation        : 29
% 0.21/0.51  # Processed clauses                    : 38
% 0.21/0.51  # ...of these trivial                  : 0
% 0.21/0.51  # ...subsumed                          : 10
% 0.21/0.51  # ...remaining for further processing  : 28
% 0.21/0.51  # Other redundant clauses eliminated   : 0
% 0.21/0.51  # Clauses deleted for lack of memory   : 0
% 0.21/0.51  # Backward-subsumed                    : 0
% 0.21/0.51  # Backward-rewritten                   : 0
% 0.21/0.51  # Generated clauses                    : 2
% 0.21/0.51  # ...of the previous two non-redundant : 1
% 0.21/0.51  # ...aggressively subsumed             : 0
% 0.21/0.51  # Contextual simplify-reflections      : 0
% 0.21/0.51  # Paramodulations                      : 2
% 0.21/0.51  # Factorizations                       : 0
% 0.21/0.51  # NegExts                              : 0
% 0.21/0.51  # Equation resolutions                 : 0
% 0.21/0.51  # Disequality decompositions           : 0
% 0.21/0.51  # Total rewrite steps                  : 1
% 0.21/0.51  # ...of those cached                   : 0
% 0.21/0.51  # Propositional unsat checks           : 0
% 0.21/0.51  #    Propositional check models        : 0
% 0.21/0.51  #    Propositional check unsatisfiable : 0
% 0.21/0.51  #    Propositional clauses             : 0
% 0.21/0.51  #    Propositional clauses after purity: 0
% 0.21/0.51  #    Propositional unsat core size     : 0
% 0.21/0.51  #    Propositional preprocessing time  : 0.000
% 0.21/0.51  #    Propositional encoding time       : 0.000
% 0.21/0.51  #    Propositional solver time         : 0.000
% 0.21/0.51  #    Success case prop preproc time    : 0.000
% 0.21/0.51  #    Success case prop encoding time   : 0.000
% 0.21/0.51  #    Success case prop solver time     : 0.000
% 0.21/0.51  # Current number of processed clauses  : 9
% 0.21/0.51  #    Positive orientable unit clauses  : 4
% 0.21/0.51  #    Positive unorientable unit clauses: 0
% 0.21/0.51  #    Negative unit clauses             : 2
% 0.21/0.51  #    Non-unit-clauses                  : 3
% 0.21/0.51  # Current number of unprocessed clauses: 11
% 0.21/0.51  # ...number of literals in the above   : 33
% 0.21/0.51  # Current number of archived formulas  : 0
% 0.21/0.51  # Current number of archived clauses   : 19
% 0.21/0.51  # Clause-clause subsumption calls (NU) : 28
% 0.21/0.51  # Rec. Clause-clause subsumption calls : 24
% 0.21/0.51  # Non-unit clause-clause subsumptions  : 10
% 0.21/0.51  # Unit Clause-clause subsumption calls : 1
% 0.21/0.51  # Rewrite failures with RHS unbound    : 0
% 0.21/0.51  # BW rewrite match attempts            : 2
% 0.21/0.51  # BW rewrite match successes           : 0
% 0.21/0.51  # Condensation attempts                : 0
% 0.21/0.51  # Condensation successes               : 0
% 0.21/0.51  # Termbank termtop insertions          : 3742
% 0.21/0.51  # Search garbage collected termcells   : 1115
% 0.21/0.51  
% 0.21/0.51  # -------------------------------------------------
% 0.21/0.51  # User time                : 0.004 s
% 0.21/0.51  # System time              : 0.007 s
% 0.21/0.51  # Total time               : 0.011 s
% 0.21/0.51  # Maximum resident set size: 2040 pages
% 0.21/0.51  
% 0.21/0.51  # -------------------------------------------------
% 0.21/0.51  # User time                : 0.013 s
% 0.21/0.51  # System time              : 0.010 s
% 0.21/0.51  # Total time               : 0.023 s
% 0.21/0.51  # Maximum resident set size: 1932 pages
% 0.21/0.51  % E---3.1 exiting
% 0.21/0.51  % E exiting
%------------------------------------------------------------------------------