TSTP Solution File: MSC015-1.005 by E-SAT---3.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E-SAT---3.1
% Problem  : MSC015-1.005 : TPTP v8.1.2. Released v3.5.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E %s %d THM

% Computer : n013.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 18:39:16 EDT 2023

% Result   : Unsatisfiable 0.19s 0.47s
% Output   : CNFRefutation 0.19s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   32
%            Number of leaves      :    7
% Syntax   : Number of clauses     :   45 (  35 unt;   0 nHn;  45 RR)
%            Number of literals    :   55 (   0 equ;  42 neg)
%            Maximal clause size   :    2 (   1 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    2 (   1 usr;   1 prp; 0-5 aty)
%            Number of functors    :    2 (   2 usr;   2 con; 0-0 aty)
%            Number of variables   :   20 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(goal,negated_conjecture,
    ~ p(s1,s1,s1,s1,s1),
    file('/export/starexec/sandbox2/tmp/tmp.XbyWkyNbBd/E---3.1_4122.p',goal) ).

cnf(rule1,axiom,
    ( p(X1,X2,X3,X4,s1)
    | ~ p(X1,X2,X3,X4,s0) ),
    file('/export/starexec/sandbox2/tmp/tmp.XbyWkyNbBd/E---3.1_4122.p',rule1) ).

cnf(rule2,axiom,
    ( p(X1,X2,X3,s1,s0)
    | ~ p(X1,X2,X3,s0,s1) ),
    file('/export/starexec/sandbox2/tmp/tmp.XbyWkyNbBd/E---3.1_4122.p',rule2) ).

cnf(rule3,axiom,
    ( p(X1,X2,s1,s0,s0)
    | ~ p(X1,X2,s0,s1,s1) ),
    file('/export/starexec/sandbox2/tmp/tmp.XbyWkyNbBd/E---3.1_4122.p',rule3) ).

cnf(rule4,axiom,
    ( p(X1,s1,s0,s0,s0)
    | ~ p(X1,s0,s1,s1,s1) ),
    file('/export/starexec/sandbox2/tmp/tmp.XbyWkyNbBd/E---3.1_4122.p',rule4) ).

cnf(rule5,axiom,
    ( p(s1,s0,s0,s0,s0)
    | ~ p(s0,s1,s1,s1,s1) ),
    file('/export/starexec/sandbox2/tmp/tmp.XbyWkyNbBd/E---3.1_4122.p',rule5) ).

cnf(init,axiom,
    p(s0,s0,s0,s0,s0),
    file('/export/starexec/sandbox2/tmp/tmp.XbyWkyNbBd/E---3.1_4122.p',init) ).

cnf(c_0_7,negated_conjecture,
    ~ p(s1,s1,s1,s1,s1),
    goal ).

cnf(c_0_8,axiom,
    ( p(X1,X2,X3,X4,s1)
    | ~ p(X1,X2,X3,X4,s0) ),
    rule1 ).

cnf(c_0_9,negated_conjecture,
    ~ p(s1,s1,s1,s1,s0),
    inference(spm,[status(thm)],[c_0_7,c_0_8]) ).

cnf(c_0_10,axiom,
    ( p(X1,X2,X3,s1,s0)
    | ~ p(X1,X2,X3,s0,s1) ),
    rule2 ).

cnf(c_0_11,negated_conjecture,
    ~ p(s1,s1,s1,s0,s1),
    inference(spm,[status(thm)],[c_0_9,c_0_10]) ).

cnf(c_0_12,negated_conjecture,
    ~ p(s1,s1,s1,s0,s0),
    inference(spm,[status(thm)],[c_0_11,c_0_8]) ).

cnf(c_0_13,axiom,
    ( p(X1,X2,s1,s0,s0)
    | ~ p(X1,X2,s0,s1,s1) ),
    rule3 ).

cnf(c_0_14,negated_conjecture,
    ~ p(s1,s1,s0,s1,s1),
    inference(spm,[status(thm)],[c_0_12,c_0_13]) ).

cnf(c_0_15,negated_conjecture,
    ~ p(s1,s1,s0,s1,s0),
    inference(spm,[status(thm)],[c_0_14,c_0_8]) ).

cnf(c_0_16,negated_conjecture,
    ~ p(s1,s1,s0,s0,s1),
    inference(spm,[status(thm)],[c_0_15,c_0_10]) ).

cnf(c_0_17,negated_conjecture,
    ~ p(s1,s1,s0,s0,s0),
    inference(spm,[status(thm)],[c_0_16,c_0_8]) ).

cnf(c_0_18,axiom,
    ( p(X1,s1,s0,s0,s0)
    | ~ p(X1,s0,s1,s1,s1) ),
    rule4 ).

cnf(c_0_19,negated_conjecture,
    ~ p(s1,s0,s1,s1,s1),
    inference(spm,[status(thm)],[c_0_17,c_0_18]) ).

cnf(c_0_20,negated_conjecture,
    ~ p(s1,s0,s1,s1,s0),
    inference(spm,[status(thm)],[c_0_19,c_0_8]) ).

cnf(c_0_21,negated_conjecture,
    ~ p(s1,s0,s1,s0,s1),
    inference(spm,[status(thm)],[c_0_20,c_0_10]) ).

cnf(c_0_22,negated_conjecture,
    ~ p(s1,s0,s1,s0,s0),
    inference(spm,[status(thm)],[c_0_21,c_0_8]) ).

cnf(c_0_23,negated_conjecture,
    ~ p(s1,s0,s0,s1,s1),
    inference(spm,[status(thm)],[c_0_22,c_0_13]) ).

cnf(c_0_24,negated_conjecture,
    ~ p(s1,s0,s0,s1,s0),
    inference(spm,[status(thm)],[c_0_23,c_0_8]) ).

cnf(c_0_25,negated_conjecture,
    ~ p(s1,s0,s0,s0,s1),
    inference(spm,[status(thm)],[c_0_24,c_0_10]) ).

cnf(c_0_26,negated_conjecture,
    ~ p(s1,s0,s0,s0,s0),
    inference(spm,[status(thm)],[c_0_25,c_0_8]) ).

cnf(c_0_27,axiom,
    ( p(s1,s0,s0,s0,s0)
    | ~ p(s0,s1,s1,s1,s1) ),
    rule5 ).

cnf(c_0_28,negated_conjecture,
    ~ p(s0,s1,s1,s1,s1),
    inference(spm,[status(thm)],[c_0_26,c_0_27]) ).

cnf(c_0_29,negated_conjecture,
    ~ p(s0,s1,s1,s1,s0),
    inference(spm,[status(thm)],[c_0_28,c_0_8]) ).

cnf(c_0_30,negated_conjecture,
    ~ p(s0,s1,s1,s0,s1),
    inference(spm,[status(thm)],[c_0_29,c_0_10]) ).

cnf(c_0_31,negated_conjecture,
    ~ p(s0,s1,s1,s0,s0),
    inference(spm,[status(thm)],[c_0_30,c_0_8]) ).

cnf(c_0_32,negated_conjecture,
    ~ p(s0,s1,s0,s1,s1),
    inference(spm,[status(thm)],[c_0_31,c_0_13]) ).

cnf(c_0_33,negated_conjecture,
    ~ p(s0,s1,s0,s1,s0),
    inference(spm,[status(thm)],[c_0_32,c_0_8]) ).

cnf(c_0_34,negated_conjecture,
    ~ p(s0,s1,s0,s0,s1),
    inference(spm,[status(thm)],[c_0_33,c_0_10]) ).

cnf(c_0_35,negated_conjecture,
    ~ p(s0,s1,s0,s0,s0),
    inference(spm,[status(thm)],[c_0_34,c_0_8]) ).

cnf(c_0_36,negated_conjecture,
    ~ p(s0,s0,s1,s1,s1),
    inference(spm,[status(thm)],[c_0_35,c_0_18]) ).

cnf(c_0_37,negated_conjecture,
    ~ p(s0,s0,s1,s1,s0),
    inference(spm,[status(thm)],[c_0_36,c_0_8]) ).

cnf(c_0_38,negated_conjecture,
    ~ p(s0,s0,s1,s0,s1),
    inference(spm,[status(thm)],[c_0_37,c_0_10]) ).

cnf(c_0_39,negated_conjecture,
    ~ p(s0,s0,s1,s0,s0),
    inference(spm,[status(thm)],[c_0_38,c_0_8]) ).

cnf(c_0_40,negated_conjecture,
    ~ p(s0,s0,s0,s1,s1),
    inference(spm,[status(thm)],[c_0_39,c_0_13]) ).

cnf(c_0_41,negated_conjecture,
    ~ p(s0,s0,s0,s1,s0),
    inference(spm,[status(thm)],[c_0_40,c_0_8]) ).

cnf(c_0_42,negated_conjecture,
    ~ p(s0,s0,s0,s0,s1),
    inference(spm,[status(thm)],[c_0_41,c_0_10]) ).

cnf(c_0_43,axiom,
    p(s0,s0,s0,s0,s0),
    init ).

cnf(c_0_44,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_8]),c_0_43])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem    : MSC015-1.005 : TPTP v8.1.2. Released v3.5.0.
% 0.12/0.13  % Command    : run_E %s %d THM
% 0.13/0.33  % Computer : n013.cluster.edu
% 0.13/0.33  % Model    : x86_64 x86_64
% 0.13/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33  % Memory   : 8042.1875MB
% 0.13/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33  % CPULimit   : 2400
% 0.13/0.33  % WCLimit    : 300
% 0.13/0.33  % DateTime   : Mon Oct  2 11:14:59 EDT 2023
% 0.13/0.33  % CPUTime    : 
% 0.19/0.46  Running first-order model finding
% 0.19/0.46  Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/tmp/tmp.XbyWkyNbBd/E---3.1_4122.p
% 0.19/0.47  # Version: 3.1pre001
% 0.19/0.47  # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.19/0.47  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.47  # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.19/0.47  # Starting new_bool_3 with 300s (1) cores
% 0.19/0.47  # Starting new_bool_1 with 300s (1) cores
% 0.19/0.47  # Starting sh5l with 300s (1) cores
% 0.19/0.47  # sh5l with pid 4226 completed with status 0
% 0.19/0.47  # Result found by sh5l
% 0.19/0.47  # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.19/0.47  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.47  # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.19/0.47  # Starting new_bool_3 with 300s (1) cores
% 0.19/0.47  # Starting new_bool_1 with 300s (1) cores
% 0.19/0.47  # Starting sh5l with 300s (1) cores
% 0.19/0.47  # SinE strategy is gf500_gu_R04_F100_L20000
% 0.19/0.47  # Search class: FHUNF-FFSF00-SFFFFFNN
% 0.19/0.47  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.47  # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.19/0.47  # SAT001_MinMin_p005000_rr_RG with pid 4230 completed with status 0
% 0.19/0.47  # Result found by SAT001_MinMin_p005000_rr_RG
% 0.19/0.47  # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.19/0.47  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.47  # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.19/0.47  # Starting new_bool_3 with 300s (1) cores
% 0.19/0.47  # Starting new_bool_1 with 300s (1) cores
% 0.19/0.47  # Starting sh5l with 300s (1) cores
% 0.19/0.47  # SinE strategy is gf500_gu_R04_F100_L20000
% 0.19/0.47  # Search class: FHUNF-FFSF00-SFFFFFNN
% 0.19/0.47  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.47  # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.19/0.47  # Preprocessing time       : 0.001 s
% 0.19/0.47  # Presaturation interreduction done
% 0.19/0.47  
% 0.19/0.47  # Proof found!
% 0.19/0.47  # SZS status Unsatisfiable
% 0.19/0.47  # SZS output start CNFRefutation
% See solution above
% 0.19/0.47  # Parsed axioms                        : 7
% 0.19/0.47  # Removed by relevancy pruning/SinE    : 0
% 0.19/0.47  # Initial clauses                      : 7
% 0.19/0.47  # Removed in clause preprocessing      : 0
% 0.19/0.47  # Initial clauses in saturation        : 7
% 0.19/0.47  # Processed clauses                    : 44
% 0.19/0.47  # ...of these trivial                  : 0
% 0.19/0.47  # ...subsumed                          : 0
% 0.19/0.47  # ...remaining for further processing  : 44
% 0.19/0.47  # Other redundant clauses eliminated   : 0
% 0.19/0.47  # Clauses deleted for lack of memory   : 0
% 0.19/0.47  # Backward-subsumed                    : 1
% 0.19/0.47  # Backward-rewritten                   : 0
% 0.19/0.47  # Generated clauses                    : 31
% 0.19/0.47  # ...of the previous two non-redundant : 30
% 0.19/0.47  # ...aggressively subsumed             : 0
% 0.19/0.47  # Contextual simplify-reflections      : 0
% 0.19/0.47  # Paramodulations                      : 31
% 0.19/0.47  # Factorizations                       : 0
% 0.19/0.47  # NegExts                              : 0
% 0.19/0.47  # Equation resolutions                 : 0
% 0.19/0.47  # Total rewrite steps                  : 1
% 0.19/0.47  # Propositional unsat checks           : 0
% 0.19/0.47  #    Propositional check models        : 0
% 0.19/0.47  #    Propositional check unsatisfiable : 0
% 0.19/0.47  #    Propositional clauses             : 0
% 0.19/0.47  #    Propositional clauses after purity: 0
% 0.19/0.47  #    Propositional unsat core size     : 0
% 0.19/0.47  #    Propositional preprocessing time  : 0.000
% 0.19/0.47  #    Propositional encoding time       : 0.000
% 0.19/0.47  #    Propositional solver time         : 0.000
% 0.19/0.47  #    Success case prop preproc time    : 0.000
% 0.19/0.47  #    Success case prop encoding time   : 0.000
% 0.19/0.47  #    Success case prop solver time     : 0.000
% 0.19/0.47  # Current number of processed clauses  : 36
% 0.19/0.47  #    Positive orientable unit clauses  : 1
% 0.19/0.47  #    Positive unorientable unit clauses: 0
% 0.19/0.47  #    Negative unit clauses             : 31
% 0.19/0.47  #    Non-unit-clauses                  : 4
% 0.19/0.47  # Current number of unprocessed clauses: 0
% 0.19/0.47  # ...number of literals in the above   : 0
% 0.19/0.47  # Current number of archived formulas  : 0
% 0.19/0.47  # Current number of archived clauses   : 8
% 0.19/0.47  # Clause-clause subsumption calls (NU) : 20
% 0.19/0.47  # Rec. Clause-clause subsumption calls : 20
% 0.19/0.47  # Non-unit clause-clause subsumptions  : 0
% 0.19/0.47  # Unit Clause-clause subsumption calls : 114
% 0.19/0.47  # Rewrite failures with RHS unbound    : 0
% 0.19/0.47  # BW rewrite match attempts            : 0
% 0.19/0.47  # BW rewrite match successes           : 0
% 0.19/0.47  # Condensation attempts                : 0
% 0.19/0.47  # Condensation successes               : 0
% 0.19/0.47  # Termbank termtop insertions          : 320
% 0.19/0.47  
% 0.19/0.47  # -------------------------------------------------
% 0.19/0.47  # User time                : 0.004 s
% 0.19/0.47  # System time              : 0.000 s
% 0.19/0.47  # Total time               : 0.004 s
% 0.19/0.47  # Maximum resident set size: 1636 pages
% 0.19/0.47  
% 0.19/0.47  # -------------------------------------------------
% 0.19/0.47  # User time                : 0.004 s
% 0.19/0.47  # System time              : 0.003 s
% 0.19/0.47  # Total time               : 0.007 s
% 0.19/0.47  # Maximum resident set size: 1672 pages
% 0.19/0.47  % E---3.1 exiting
%------------------------------------------------------------------------------