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

View Problem - Process Solution

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

% Computer : n023.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:15 EDT 2023

% Result   : Unsatisfiable 0.21s 0.51s
% Output   : CNFRefutation 0.21s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :   12
% Syntax   : Number of clauses     :   32 (  21 unt;   6 nHn;  24 RR)
%            Number of literals    :   54 (  21 equ;  22 neg)
%            Maximal clause size   :    5 (   1 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    8 (   6 usr;   1 prp; 0-2 aty)
%            Number of functors    :    7 (   7 usr;   3 con; 0-2 aty)
%            Number of variables   :   26 (   2 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(axiom_5,axiom,
    ( minus(X1,X2) = X3
    | def_10(X2,X1)
    | plus(X3,X2) != X1 ),
    file('/export/starexec/sandbox2/tmp/tmp.BTYU5FNAYS/E---3.1_4562.p',axiom_5) ).

cnf(axiom_7,axiom,
    ( ~ def_10(X1,X2)
    | X2 != X1 ),
    file('/export/starexec/sandbox2/tmp/tmp.BTYU5FNAYS/E---3.1_4562.p',axiom_7) ).

cnf(axiom_71,axiom,
    ( p_Reset(X1)
    | p_Wr(X1)
    | int_level(plus(X1,n1)) = minus(int_level(X1),n1)
    | ~ p_Rd(X1)
    | ~ gt(int_level(X1),n0) ),
    file('/export/starexec/sandbox2/tmp/tmp.BTYU5FNAYS/E---3.1_4562.p',axiom_71) ).

cnf(axiom_21,axiom,
    level(X1) = int_level(X1),
    file('/export/starexec/sandbox2/tmp/tmp.BTYU5FNAYS/E---3.1_4562.p',axiom_21) ).

cnf(axiom_19,axiom,
    plus(n0,X1) = X1,
    file('/export/starexec/sandbox2/tmp/tmp.BTYU5FNAYS/E---3.1_4562.p',axiom_19) ).

cnf(axiom_2,axiom,
    gt(plus(X1,n1),n0),
    file('/export/starexec/sandbox2/tmp/tmp.BTYU5FNAYS/E---3.1_4562.p',axiom_2) ).

cnf(axiom_24,axiom,
    ( p_Empty(X1)
    | int_level(X1) != n0 ),
    file('/export/starexec/sandbox2/tmp/tmp.BTYU5FNAYS/E---3.1_4562.p',axiom_24) ).

cnf(quest_1,negated_conjecture,
    level(t_139) = n1,
    file('/export/starexec/sandbox2/tmp/tmp.BTYU5FNAYS/E---3.1_4562.p',quest_1) ).

cnf(quest_3,negated_conjecture,
    p_Rd(t_139),
    file('/export/starexec/sandbox2/tmp/tmp.BTYU5FNAYS/E---3.1_4562.p',quest_3) ).

cnf(quest_2,negated_conjecture,
    ~ p_Wr(t_139),
    file('/export/starexec/sandbox2/tmp/tmp.BTYU5FNAYS/E---3.1_4562.p',quest_2) ).

cnf(quest_4,negated_conjecture,
    ~ p_Reset(t_139),
    file('/export/starexec/sandbox2/tmp/tmp.BTYU5FNAYS/E---3.1_4562.p',quest_4) ).

cnf(quest_5,negated_conjecture,
    ~ p_Empty(plus(t_139,n1)),
    file('/export/starexec/sandbox2/tmp/tmp.BTYU5FNAYS/E---3.1_4562.p',quest_5) ).

cnf(c_0_12,axiom,
    ( minus(X1,X2) = X3
    | def_10(X2,X1)
    | plus(X3,X2) != X1 ),
    axiom_5 ).

cnf(c_0_13,axiom,
    ( ~ def_10(X1,X2)
    | X2 != X1 ),
    axiom_7 ).

cnf(c_0_14,axiom,
    ( p_Reset(X1)
    | p_Wr(X1)
    | int_level(plus(X1,n1)) = minus(int_level(X1),n1)
    | ~ p_Rd(X1)
    | ~ gt(int_level(X1),n0) ),
    axiom_71 ).

cnf(c_0_15,axiom,
    level(X1) = int_level(X1),
    axiom_21 ).

cnf(c_0_16,plain,
    ( minus(plus(X1,X2),X2) = X1
    | def_10(X2,plus(X1,X2)) ),
    inference(er,[status(thm)],[c_0_12]) ).

cnf(c_0_17,axiom,
    plus(n0,X1) = X1,
    axiom_19 ).

cnf(c_0_18,plain,
    ~ def_10(X1,X1),
    inference(er,[status(thm)],[c_0_13]) ).

cnf(c_0_19,axiom,
    gt(plus(X1,n1),n0),
    axiom_2 ).

cnf(c_0_20,axiom,
    ( p_Empty(X1)
    | int_level(X1) != n0 ),
    axiom_24 ).

cnf(c_0_21,plain,
    ( level(plus(X1,n1)) = minus(level(X1),n1)
    | p_Reset(X1)
    | p_Wr(X1)
    | ~ p_Rd(X1)
    | ~ gt(level(X1),n0) ),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_14,c_0_15]),c_0_15]),c_0_15]) ).

cnf(c_0_22,negated_conjecture,
    level(t_139) = n1,
    quest_1 ).

cnf(c_0_23,negated_conjecture,
    p_Rd(t_139),
    quest_3 ).

cnf(c_0_24,negated_conjecture,
    ~ p_Wr(t_139),
    quest_2 ).

cnf(c_0_25,negated_conjecture,
    ~ p_Reset(t_139),
    quest_4 ).

cnf(c_0_26,plain,
    minus(X1,X1) = n0,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18]) ).

cnf(c_0_27,plain,
    gt(n1,n0),
    inference(spm,[status(thm)],[c_0_19,c_0_17]) ).

cnf(c_0_28,plain,
    ( p_Empty(X1)
    | level(X1) != n0 ),
    inference(rw,[status(thm)],[c_0_20,c_0_15]) ).

cnf(c_0_29,negated_conjecture,
    level(plus(t_139,n1)) = n0,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_23])]),c_0_24]),c_0_25]),c_0_26]),c_0_27])]) ).

cnf(c_0_30,negated_conjecture,
    ~ p_Empty(plus(t_139,n1)),
    quest_5 ).

cnf(c_0_31,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_30]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem    : HWV023-1 : TPTP v8.1.2. Released v2.5.0.
% 0.11/0.14  % Command    : run_E %s %d THM
% 0.14/0.35  % Computer : n023.cluster.edu
% 0.14/0.35  % Model    : x86_64 x86_64
% 0.14/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35  % Memory   : 8042.1875MB
% 0.14/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35  % CPULimit   : 2400
% 0.14/0.35  % WCLimit    : 300
% 0.14/0.35  % DateTime   : Tue Oct  3 05:28:52 EDT 2023
% 0.14/0.35  % CPUTime    : 
% 0.21/0.48  Running first-order theorem proving
% 0.21/0.48  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.BTYU5FNAYS/E---3.1_4562.p
% 0.21/0.51  # Version: 3.1pre001
% 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  # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 4640 completed with status 0
% 0.21/0.51  # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 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  # No SInE strategy applied
% 0.21/0.51  # Search class: FGHSS-FFMS21-SFFFFFNN
% 0.21/0.51  # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.21/0.51  # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.21/0.51  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.21/0.51  # Starting new_bool_3 with 136s (1) cores
% 0.21/0.51  # Starting new_bool_1 with 136s (1) cores
% 0.21/0.51  # Starting sh5l with 136s (1) cores
% 0.21/0.51  # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 4647 completed with status 0
% 0.21/0.51  # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 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  # No SInE strategy applied
% 0.21/0.51  # Search class: FGHSS-FFMS21-SFFFFFNN
% 0.21/0.51  # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.21/0.51  # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.21/0.51  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.21/0.51  # Preprocessing time       : 0.002 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                        : 95
% 0.21/0.51  # Removed by relevancy pruning/SinE    : 0
% 0.21/0.51  # Initial clauses                      : 95
% 0.21/0.51  # Removed in clause preprocessing      : 1
% 0.21/0.51  # Initial clauses in saturation        : 94
% 0.21/0.51  # Processed clauses                    : 214
% 0.21/0.51  # ...of these trivial                  : 3
% 0.21/0.51  # ...subsumed                          : 10
% 0.21/0.51  # ...remaining for further processing  : 201
% 0.21/0.51  # Other redundant clauses eliminated   : 6
% 0.21/0.51  # Clauses deleted for lack of memory   : 0
% 0.21/0.51  # Backward-subsumed                    : 16
% 0.21/0.51  # Backward-rewritten                   : 2
% 0.21/0.51  # Generated clauses                    : 291
% 0.21/0.51  # ...of the previous two non-redundant : 231
% 0.21/0.51  # ...aggressively subsumed             : 0
% 0.21/0.51  # Contextual simplify-reflections      : 61
% 0.21/0.51  # Paramodulations                      : 282
% 0.21/0.51  # Factorizations                       : 2
% 0.21/0.51  # NegExts                              : 0
% 0.21/0.51  # Equation resolutions                 : 7
% 0.21/0.51  # Total rewrite steps                  : 42
% 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  : 104
% 0.21/0.51  #    Positive orientable unit clauses  : 12
% 0.21/0.51  #    Positive unorientable unit clauses: 0
% 0.21/0.51  #    Negative unit clauses             : 7
% 0.21/0.51  #    Non-unit-clauses                  : 85
% 0.21/0.51  # Current number of unprocessed clauses: 186
% 0.21/0.51  # ...number of literals in the above   : 851
% 0.21/0.51  # Current number of archived formulas  : 0
% 0.21/0.51  # Current number of archived clauses   : 95
% 0.21/0.51  # Clause-clause subsumption calls (NU) : 3162
% 0.21/0.51  # Rec. Clause-clause subsumption calls : 665
% 0.21/0.51  # Non-unit clause-clause subsumptions  : 83
% 0.21/0.51  # Unit Clause-clause subsumption calls : 169
% 0.21/0.51  # Rewrite failures with RHS unbound    : 0
% 0.21/0.51  # BW rewrite match attempts            : 7
% 0.21/0.51  # BW rewrite match successes           : 2
% 0.21/0.51  # Condensation attempts                : 0
% 0.21/0.51  # Condensation successes               : 0
% 0.21/0.51  # Termbank termtop insertions          : 9449
% 0.21/0.51  
% 0.21/0.51  # -------------------------------------------------
% 0.21/0.51  # User time                : 0.019 s
% 0.21/0.51  # System time              : 0.005 s
% 0.21/0.51  # Total time               : 0.024 s
% 0.21/0.51  # Maximum resident set size: 1816 pages
% 0.21/0.51  
% 0.21/0.51  # -------------------------------------------------
% 0.21/0.51  # User time                : 0.081 s
% 0.21/0.51  # System time              : 0.011 s
% 0.21/0.51  # Total time               : 0.092 s
% 0.21/0.51  # Maximum resident set size: 1740 pages
% 0.21/0.51  % E---3.1 exiting
% 0.21/0.52  % E---3.1 exiting
%------------------------------------------------------------------------------