TSTP Solution File: SWW302+1 by E---3.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E---3.1
% Problem  : SWW302+1 : TPTP v8.1.2. Released v5.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E %s %d THM

% Computer : n009.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 20:09:02 EDT 2023

% Result   : Theorem 2.70s 2.94s
% Output   : CNFRefutation 2.70s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    2
% Syntax   : Number of formulae    :   11 (   3 unt;   0 def)
%            Number of atoms       :   25 (   0 equ)
%            Maximal formula atoms :    4 (   2 avg)
%            Number of connectives :   22 (   8   ~;   5   |;   2   &)
%                                         (   0 <=>;   7  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   4 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    4 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :    3 (   3 usr;   3 con; 0-0 aty)
%            Number of variables   :   17 (   0 sgn;  13   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(conj_1,conjecture,
    ! [X282,X283] :
      ( v_P(X282,X283)
     => ! [X284] :
          ( ! [X285] :
              ( v_P(X285,X283)
             => v_Q_H(X285,X284) )
         => v_Q(X282,X284) ) ),
    file('/export/starexec/sandbox2/tmp/tmp.IVfmSjMgvg/E---3.1_23012.p',conj_1) ).

fof(conj_0,hypothesis,
    ! [X282,X283] :
      ( v_Q_H(X282,X283)
     => v_Q(X282,X283) ),
    file('/export/starexec/sandbox2/tmp/tmp.IVfmSjMgvg/E---3.1_23012.p',conj_0) ).

fof(c_0_2,negated_conjecture,
    ~ ! [X282,X283] :
        ( v_P(X282,X283)
       => ! [X284] :
            ( ! [X285] :
                ( v_P(X285,X283)
               => v_Q_H(X285,X284) )
           => v_Q(X282,X284) ) ),
    inference(assume_negation,[status(cth)],[conj_1]) ).

fof(c_0_3,hypothesis,
    ! [X286,X287] :
      ( ~ v_Q_H(X286,X287)
      | v_Q(X286,X287) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[conj_0])]) ).

fof(c_0_4,negated_conjecture,
    ! [X291] :
      ( v_P(esk1_0,esk2_0)
      & ( ~ v_P(X291,esk2_0)
        | v_Q_H(X291,esk3_0) )
      & ~ v_Q(esk1_0,esk3_0) ),
    inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_2])])])]) ).

cnf(c_0_5,hypothesis,
    ( v_Q(X1,X2)
    | ~ v_Q_H(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_3]) ).

cnf(c_0_6,negated_conjecture,
    ( v_Q_H(X1,esk3_0)
    | ~ v_P(X1,esk2_0) ),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

cnf(c_0_7,negated_conjecture,
    ~ v_Q(esk1_0,esk3_0),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

cnf(c_0_8,negated_conjecture,
    ( v_Q(X1,esk3_0)
    | ~ v_P(X1,esk2_0) ),
    inference(spm,[status(thm)],[c_0_5,c_0_6]) ).

cnf(c_0_9,negated_conjecture,
    v_P(esk1_0,esk2_0),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 1.17/1.21  % Problem    : SWW302+1 : TPTP v8.1.2. Released v5.2.0.
% 1.17/1.22  % Command    : run_E %s %d THM
% 1.21/1.42  % Computer : n009.cluster.edu
% 1.21/1.42  % Model    : x86_64 x86_64
% 1.21/1.42  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 1.21/1.42  % Memory   : 8042.1875MB
% 1.21/1.42  % OS       : Linux 3.10.0-693.el7.x86_64
% 1.21/1.42  % CPULimit   : 2400
% 1.21/1.42  % WCLimit    : 300
% 1.21/1.42  % DateTime   : Mon Oct  2 22:06:31 EDT 2023
% 1.21/1.42  % CPUTime    : 
% 2.41/2.63  Running first-order theorem proving
% 2.41/2.63  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.IVfmSjMgvg/E---3.1_23012.p
% 2.70/2.94  # Version: 3.1pre001
% 2.70/2.94  # Preprocessing class: FMLMSMSMSSSNFFN.
% 2.70/2.94  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.70/2.94  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 2.70/2.94  # Starting new_bool_3 with 300s (1) cores
% 2.70/2.94  # Starting new_bool_1 with 300s (1) cores
% 2.70/2.94  # Starting sh5l with 300s (1) cores
% 2.70/2.94  # new_bool_1 with pid 23094 completed with status 0
% 2.70/2.94  # Result found by new_bool_1
% 2.70/2.94  # Preprocessing class: FMLMSMSMSSSNFFN.
% 2.70/2.94  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.70/2.94  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 2.70/2.94  # Starting new_bool_3 with 300s (1) cores
% 2.70/2.94  # Starting new_bool_1 with 300s (1) cores
% 2.70/2.94  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 2.70/2.94  # Search class: FHUNF-FFSF00-SFFFFFNN
% 2.70/2.94  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 2.70/2.94  # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 2.70/2.94  # SAT001_MinMin_p005000_rr_RG with pid 23097 completed with status 0
% 2.70/2.94  # Result found by SAT001_MinMin_p005000_rr_RG
% 2.70/2.94  # Preprocessing class: FMLMSMSMSSSNFFN.
% 2.70/2.94  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.70/2.94  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 2.70/2.94  # Starting new_bool_3 with 300s (1) cores
% 2.70/2.94  # Starting new_bool_1 with 300s (1) cores
% 2.70/2.94  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 2.70/2.94  # Search class: FHUNF-FFSF00-SFFFFFNN
% 2.70/2.94  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 2.70/2.94  # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 2.70/2.94  # Preprocessing time       : 0.002 s
% 2.70/2.94  # Presaturation interreduction done
% 2.70/2.94  
% 2.70/2.94  # Proof found!
% 2.70/2.94  # SZS status Theorem
% 2.70/2.94  # SZS output start CNFRefutation
% See solution above
% 2.70/2.94  # Parsed axioms                        : 5242
% 2.70/2.94  # Removed by relevancy pruning/SinE    : 5240
% 2.70/2.94  # Initial clauses                      : 4
% 2.70/2.94  # Removed in clause preprocessing      : 0
% 2.70/2.94  # Initial clauses in saturation        : 4
% 2.70/2.94  # Processed clauses                    : 9
% 2.70/2.94  # ...of these trivial                  : 0
% 2.70/2.94  # ...subsumed                          : 0
% 2.70/2.94  # ...remaining for further processing  : 9
% 2.70/2.94  # Other redundant clauses eliminated   : 0
% 2.70/2.94  # Clauses deleted for lack of memory   : 0
% 2.70/2.94  # Backward-subsumed                    : 0
% 2.70/2.94  # Backward-rewritten                   : 0
% 2.70/2.94  # Generated clauses                    : 2
% 2.70/2.94  # ...of the previous two non-redundant : 1
% 2.70/2.94  # ...aggressively subsumed             : 0
% 2.70/2.94  # Contextual simplify-reflections      : 0
% 2.70/2.94  # Paramodulations                      : 2
% 2.70/2.94  # Factorizations                       : 0
% 2.70/2.94  # NegExts                              : 0
% 2.70/2.94  # Equation resolutions                 : 0
% 2.70/2.94  # Total rewrite steps                  : 1
% 2.70/2.94  # Propositional unsat checks           : 0
% 2.70/2.94  #    Propositional check models        : 0
% 2.70/2.94  #    Propositional check unsatisfiable : 0
% 2.70/2.94  #    Propositional clauses             : 0
% 2.70/2.94  #    Propositional clauses after purity: 0
% 2.70/2.94  #    Propositional unsat core size     : 0
% 2.70/2.94  #    Propositional preprocessing time  : 0.000
% 2.70/2.94  #    Propositional encoding time       : 0.000
% 2.70/2.94  #    Propositional solver time         : 0.000
% 2.70/2.94  #    Success case prop preproc time    : 0.000
% 2.70/2.94  #    Success case prop encoding time   : 0.000
% 2.70/2.94  #    Success case prop solver time     : 0.000
% 2.70/2.94  # Current number of processed clauses  : 5
% 2.70/2.94  #    Positive orientable unit clauses  : 1
% 2.70/2.94  #    Positive unorientable unit clauses: 0
% 2.70/2.94  #    Negative unit clauses             : 1
% 2.70/2.94  #    Non-unit-clauses                  : 3
% 2.70/2.94  # Current number of unprocessed clauses: 0
% 2.70/2.94  # ...number of literals in the above   : 0
% 2.70/2.94  # Current number of archived formulas  : 0
% 2.70/2.94  # Current number of archived clauses   : 4
% 2.70/2.94  # Clause-clause subsumption calls (NU) : 0
% 2.70/2.94  # Rec. Clause-clause subsumption calls : 0
% 2.70/2.94  # Non-unit clause-clause subsumptions  : 0
% 2.70/2.94  # Unit Clause-clause subsumption calls : 0
% 2.70/2.94  # Rewrite failures with RHS unbound    : 0
% 2.70/2.94  # BW rewrite match attempts            : 0
% 2.70/2.94  # BW rewrite match successes           : 0
% 2.70/2.94  # Condensation attempts                : 0
% 2.70/2.94  # Condensation successes               : 0
% 2.70/2.94  # Termbank termtop insertions          : 130361
% 2.70/2.94  
% 2.70/2.94  # -------------------------------------------------
% 2.70/2.94  # User time                : 0.030 s
% 2.70/2.94  # System time              : 0.010 s
% 2.70/2.94  # Total time               : 0.040 s
% 2.70/2.94  # Maximum resident set size: 10560 pages
% 2.70/2.94  
% 2.70/2.94  # -------------------------------------------------
% 2.70/2.94  # User time                : 0.268 s
% 2.70/2.94  # System time              : 0.019 s
% 2.70/2.94  # Total time               : 0.287 s
% 2.70/2.94  # Maximum resident set size: 9464 pages
% 2.70/2.94  % E---3.1 exiting
% 2.70/2.94  % E---3.1 exiting
%------------------------------------------------------------------------------