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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E---3.1
% Problem  : HWV025-1 : TPTP v8.1.2. Released v2.5.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E %s %d THM

% Computer : n026.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:51:16 EDT 2023

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

% Comments : 
%------------------------------------------------------------------------------
cnf(axiom_49,axiom,
    ( p_Reset(X1)
    | p_Rd(X1)
    | p_Rd_error(X1)
    | ~ p_Wr(X1)
    | ~ p_Rd_error(plus(X1,n1)) ),
    file('/export/starexec/sandbox2/tmp/tmp.2d2G5IZxYx/E---3.1_16390.p',axiom_49) ).

cnf(axiom_30,axiom,
    ( ~ p_Reset(X1)
    | ~ p_Rd_error(plus(X1,n1)) ),
    file('/export/starexec/sandbox2/tmp/tmp.2d2G5IZxYx/E---3.1_16390.p',axiom_30) ).

cnf(axiom_85,axiom,
    ( p_Reset(X1)
    | p_Wr(X1)
    | p_Rd(X1)
    | p_Rd_error(X1)
    | ~ p_Rd_error(plus(X1,n1)) ),
    file('/export/starexec/sandbox2/tmp/tmp.2d2G5IZxYx/E---3.1_16390.p',axiom_85) ).

cnf(quest_1,negated_conjecture,
    ~ p_Rd(t_139),
    file('/export/starexec/sandbox2/tmp/tmp.2d2G5IZxYx/E---3.1_16390.p',quest_1) ).

cnf(quest_4,negated_conjecture,
    ( p_Rd_error(t_139)
    | p_Rd_error(plus(t_139,n1)) ),
    file('/export/starexec/sandbox2/tmp/tmp.2d2G5IZxYx/E---3.1_16390.p',quest_4) ).

cnf(axiom_86,axiom,
    ( p_Reset(X1)
    | p_Wr(X1)
    | p_Rd(X1)
    | p_Rd_error(plus(X1,n1))
    | ~ p_Rd_error(X1) ),
    file('/export/starexec/sandbox2/tmp/tmp.2d2G5IZxYx/E---3.1_16390.p',axiom_86) ).

cnf(axiom_50,axiom,
    ( p_Reset(X1)
    | p_Rd(X1)
    | p_Rd_error(plus(X1,n1))
    | ~ p_Wr(X1)
    | ~ p_Rd_error(X1) ),
    file('/export/starexec/sandbox2/tmp/tmp.2d2G5IZxYx/E---3.1_16390.p',axiom_50) ).

cnf(quest_3,negated_conjecture,
    ( ~ p_Rd_error(t_139)
    | ~ p_Rd_error(plus(t_139,n1)) ),
    file('/export/starexec/sandbox2/tmp/tmp.2d2G5IZxYx/E---3.1_16390.p',quest_3) ).

cnf(quest_2,negated_conjecture,
    ~ p_Reset(t_139),
    file('/export/starexec/sandbox2/tmp/tmp.2d2G5IZxYx/E---3.1_16390.p',quest_2) ).

cnf(c_0_9,axiom,
    ( p_Reset(X1)
    | p_Rd(X1)
    | p_Rd_error(X1)
    | ~ p_Wr(X1)
    | ~ p_Rd_error(plus(X1,n1)) ),
    axiom_49 ).

cnf(c_0_10,axiom,
    ( ~ p_Reset(X1)
    | ~ p_Rd_error(plus(X1,n1)) ),
    axiom_30 ).

cnf(c_0_11,axiom,
    ( p_Reset(X1)
    | p_Wr(X1)
    | p_Rd(X1)
    | p_Rd_error(X1)
    | ~ p_Rd_error(plus(X1,n1)) ),
    axiom_85 ).

cnf(c_0_12,plain,
    ( p_Rd(X1)
    | p_Rd_error(X1)
    | ~ p_Wr(X1)
    | ~ p_Rd_error(plus(X1,n1)) ),
    inference(csr,[status(thm)],[c_0_9,c_0_10]) ).

cnf(c_0_13,negated_conjecture,
    ~ p_Rd(t_139),
    quest_1 ).

cnf(c_0_14,plain,
    ( p_Rd(X1)
    | p_Rd_error(X1)
    | ~ p_Rd_error(plus(X1,n1)) ),
    inference(csr,[status(thm)],[inference(csr,[status(thm)],[c_0_11,c_0_10]),c_0_12]) ).

cnf(c_0_15,negated_conjecture,
    ( p_Rd_error(t_139)
    | p_Rd_error(plus(t_139,n1)) ),
    quest_4 ).

cnf(c_0_16,axiom,
    ( p_Reset(X1)
    | p_Wr(X1)
    | p_Rd(X1)
    | p_Rd_error(plus(X1,n1))
    | ~ p_Rd_error(X1) ),
    axiom_86 ).

cnf(c_0_17,axiom,
    ( p_Reset(X1)
    | p_Rd(X1)
    | p_Rd_error(plus(X1,n1))
    | ~ p_Wr(X1)
    | ~ p_Rd_error(X1) ),
    axiom_50 ).

cnf(c_0_18,negated_conjecture,
    ( ~ p_Rd_error(t_139)
    | ~ p_Rd_error(plus(t_139,n1)) ),
    quest_3 ).

cnf(c_0_19,negated_conjecture,
    p_Rd_error(t_139),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_15]) ).

cnf(c_0_20,plain,
    ( p_Rd(X1)
    | p_Rd_error(plus(X1,n1))
    | p_Reset(X1)
    | ~ p_Rd_error(X1) ),
    inference(csr,[status(thm)],[c_0_16,c_0_17]) ).

cnf(c_0_21,negated_conjecture,
    ~ p_Rd_error(plus(t_139,n1)),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_18,c_0_19])]) ).

cnf(c_0_22,negated_conjecture,
    ~ p_Reset(t_139),
    quest_2 ).

cnf(c_0_23,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_20]),c_0_19])]),c_0_21]),c_0_22]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.22  % Problem    : HWV025-1 : TPTP v8.1.2. Released v2.5.0.
% 0.07/0.23  % Command    : run_E %s %d THM
% 0.10/0.45  % Computer : n026.cluster.edu
% 0.10/0.45  % Model    : x86_64 x86_64
% 0.10/0.45  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.45  % Memory   : 8042.1875MB
% 0.10/0.45  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.10/0.45  % CPULimit   : 2400
% 0.10/0.45  % WCLimit    : 300
% 0.10/0.45  % DateTime   : Tue Oct  3 05:40:14 EDT 2023
% 0.10/0.45  % CPUTime    : 
% 0.15/0.56  Running first-order theorem proving
% 0.15/0.56  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.2d2G5IZxYx/E---3.1_16390.p
% 0.15/0.57  # Version: 3.1pre001
% 0.15/0.57  # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.15/0.57  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.57  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.15/0.57  # Starting new_bool_3 with 300s (1) cores
% 0.15/0.57  # Starting new_bool_1 with 300s (1) cores
% 0.15/0.57  # Starting sh5l with 300s (1) cores
% 0.15/0.57  # new_bool_3 with pid 16469 completed with status 0
% 0.15/0.57  # Result found by new_bool_3
% 0.15/0.57  # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.15/0.57  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.57  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.15/0.57  # Starting new_bool_3 with 300s (1) cores
% 0.15/0.57  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/0.57  # Search class: FGHSS-FFMF21-SFFFFFNN
% 0.15/0.57  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.57  # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.15/0.57  # SAT001_MinMin_p005000_rr_RG with pid 16472 completed with status 0
% 0.15/0.57  # Result found by SAT001_MinMin_p005000_rr_RG
% 0.15/0.57  # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.15/0.57  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.57  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.15/0.57  # Starting new_bool_3 with 300s (1) cores
% 0.15/0.57  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/0.57  # Search class: FGHSS-FFMF21-SFFFFFNN
% 0.15/0.57  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.57  # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.15/0.57  # Preprocessing time       : 0.002 s
% 0.15/0.57  # Presaturation interreduction done
% 0.15/0.57  
% 0.15/0.57  # Proof found!
% 0.15/0.57  # SZS status Unsatisfiable
% 0.15/0.57  # SZS output start CNFRefutation
% See solution above
% 0.15/0.57  # Parsed axioms                        : 94
% 0.15/0.57  # Removed by relevancy pruning/SinE    : 62
% 0.15/0.57  # Initial clauses                      : 32
% 0.15/0.57  # Removed in clause preprocessing      : 0
% 0.15/0.57  # Initial clauses in saturation        : 32
% 0.15/0.57  # Processed clauses                    : 58
% 0.15/0.57  # ...of these trivial                  : 0
% 0.15/0.57  # ...subsumed                          : 3
% 0.15/0.57  # ...remaining for further processing  : 55
% 0.15/0.57  # Other redundant clauses eliminated   : 0
% 0.15/0.57  # Clauses deleted for lack of memory   : 0
% 0.15/0.57  # Backward-subsumed                    : 4
% 0.15/0.57  # Backward-rewritten                   : 3
% 0.15/0.57  # Generated clauses                    : 18
% 0.15/0.57  # ...of the previous two non-redundant : 15
% 0.15/0.57  # ...aggressively subsumed             : 0
% 0.15/0.57  # Contextual simplify-reflections      : 10
% 0.15/0.57  # Paramodulations                      : 17
% 0.15/0.57  # Factorizations                       : 0
% 0.15/0.57  # NegExts                              : 0
% 0.15/0.57  # Equation resolutions                 : 1
% 0.15/0.57  # Total rewrite steps                  : 5
% 0.15/0.57  # Propositional unsat checks           : 0
% 0.15/0.57  #    Propositional check models        : 0
% 0.15/0.57  #    Propositional check unsatisfiable : 0
% 0.15/0.57  #    Propositional clauses             : 0
% 0.15/0.57  #    Propositional clauses after purity: 0
% 0.15/0.57  #    Propositional unsat core size     : 0
% 0.15/0.57  #    Propositional preprocessing time  : 0.000
% 0.15/0.57  #    Propositional encoding time       : 0.000
% 0.15/0.57  #    Propositional solver time         : 0.000
% 0.15/0.57  #    Success case prop preproc time    : 0.000
% 0.15/0.57  #    Success case prop encoding time   : 0.000
% 0.15/0.57  #    Success case prop solver time     : 0.000
% 0.15/0.57  # Current number of processed clauses  : 22
% 0.15/0.57  #    Positive orientable unit clauses  : 4
% 0.15/0.57  #    Positive unorientable unit clauses: 0
% 0.15/0.57  #    Negative unit clauses             : 6
% 0.15/0.57  #    Non-unit-clauses                  : 12
% 0.15/0.57  # Current number of unprocessed clauses: 15
% 0.15/0.57  # ...number of literals in the above   : 46
% 0.15/0.57  # Current number of archived formulas  : 0
% 0.15/0.57  # Current number of archived clauses   : 33
% 0.15/0.57  # Clause-clause subsumption calls (NU) : 102
% 0.15/0.57  # Rec. Clause-clause subsumption calls : 39
% 0.15/0.57  # Non-unit clause-clause subsumptions  : 16
% 0.15/0.57  # Unit Clause-clause subsumption calls : 3
% 0.15/0.57  # Rewrite failures with RHS unbound    : 0
% 0.15/0.57  # BW rewrite match attempts            : 2
% 0.15/0.57  # BW rewrite match successes           : 2
% 0.15/0.57  # Condensation attempts                : 0
% 0.15/0.57  # Condensation successes               : 0
% 0.15/0.57  # Termbank termtop insertions          : 2275
% 0.15/0.57  
% 0.15/0.57  # -------------------------------------------------
% 0.15/0.57  # User time                : 0.004 s
% 0.15/0.57  # System time              : 0.002 s
% 0.15/0.57  # Total time               : 0.006 s
% 0.15/0.57  # Maximum resident set size: 1780 pages
% 0.15/0.57  
% 0.15/0.57  # -------------------------------------------------
% 0.15/0.57  # User time                : 0.008 s
% 0.15/0.57  # System time              : 0.003 s
% 0.15/0.57  # Total time               : 0.010 s
% 0.15/0.57  # Maximum resident set size: 1740 pages
% 0.15/0.57  % E---3.1 exiting
% 0.15/0.57  % E---3.1 exiting
%------------------------------------------------------------------------------