TSTP Solution File: SYN953+1 by E-SAT---3.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E-SAT---3.1
% Problem  : SYN953+1 : TPTP v8.1.2. Released v3.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E %s %d THM

% Computer : n020.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:42:47 EDT 2023

% Result   : Timeout 0.34s 300.13s
% Output   : None 
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    1
% Syntax   : Number of formulae    :    8 (   4 unt;   0 def)
%            Number of atoms       :   18 (   0 equ)
%            Maximal formula atoms :    4 (   2 avg)
%            Number of connectives :   15 (   5   ~;   2   |;   2   &)
%                                         (   0 <=>;   6  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   3 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-1 aty)
%            Number of functors    :    1 (   1 usr;   1 con; 0-0 aty)
%            Number of variables   :   11 (   2 sgn;   8   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(prove_this,conjecture,
    ( ! [X1] :
        ( p(X1)
       => q(X1) )
   => ( ! [X1] : p(X1)
     => ! [X1] : q(X1) ) ),
    file('/export/starexec/sandbox/tmp/tmp.aZgVp0IJLj/E---3.1_2815.p',prove_this) ).

fof(c_0_1,negated_conjecture,
    ~ ( ! [X1] :
          ( p(X1)
         => q(X1) )
     => ( ! [X1] : p(X1)
       => ! [X1] : q(X1) ) ),
    inference(assume_negation,[status(cth)],[prove_this]) ).

fof(c_0_2,negated_conjecture,
    ! [X2,X3] :
      ( ( ~ p(X2)
        | q(X2) )
      & p(X3)
      & ~ q(esk1_0) ),
    inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_1])])])]) ).

cnf(c_0_3,negated_conjecture,
    ( q(X1)
    | ~ p(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

cnf(c_0_4,negated_conjecture,
    p(X1),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

cnf(c_0_5,negated_conjecture,
    ~ q(esk1_0),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

cnf(c_0_6,negated_conjecture,
    q(X1),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_3,c_0_4])]) ).

cnf(c_0_7,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_5,c_0_6])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.13  % Problem    : SYN953+1 : TPTP v8.1.2. Released v3.1.0.
% 0.11/0.14  % Command    : run_E %s %d THM
% 0.13/0.35  % Computer : n020.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   : 2400
% 0.13/0.35  % WCLimit    : 300
% 0.13/0.35  % DateTime   : Mon Oct  2 18:44:31 EDT 2023
% 0.13/0.36  % CPUTime    : 
% 0.21/0.49  Running first-order model finding
% 0.21/0.49  Running: /export/starexec/sandbox/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/sandbox/tmp/tmp.aZgVp0IJLj/E---3.1_2815.p
% 0.34/300.13  # Version: 3.1pre001
% 0.34/300.13  # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.34/300.13  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.34/300.13  # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.34/300.13  # Starting new_bool_3 with 300s (1) cores
% 0.34/300.13  # Starting new_bool_1 with 300s (1) cores
% 0.34/300.13  # Starting sh5l with 300s (1) cores
% 0.34/300.13  # new_bool_3 with pid 2964 completed with status 0
% 0.34/300.13  # Result found by new_bool_3
% 0.34/300.13  # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.34/300.13  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.34/300.13  # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.34/300.13  # Starting new_bool_3 with 300s (1) cores
% 0.34/300.13  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.34/300.13  # Search class: FHUNF-FFSF00-SFFFFFNN
% 0.34/300.13  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.34/300.13  # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.34/300.13  # SAT001_MinMin_p005000_rr_RG with pid 2969 completed with status 0
% 0.34/300.13  # Result found by SAT001_MinMin_p005000_rr_RG
% 0.34/300.13  # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.34/300.13  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.34/300.13  # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.34/300.13  # Starting new_bool_3 with 300s (1) cores
% 0.34/300.13  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.34/300.13  # Search class: FHUNF-FFSF00-SFFFFFNN
% 0.34/300.13  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.34/300.13  # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.34/300.13  # Preprocessing time       : 0.001 s
% 0.34/300.13  # Presaturation interreduction done
% 0.34/300.13  
% 0.34/300.13  # Proof found!
% 0.34/300.13  # SZS status Theorem
% 0.34/300.13  # SZS output start CNFRefutation
% See solution above
% 0.34/300.13  # Parsed axioms                        : 1
% 0.34/300.13  # Removed by relevancy pruning/SinE    : 0
% 0.34/300.13  # Initial clauses                      : 3
% 0.34/300.13  # Removed in clause preprocessing      : 0
% 0.34/300.13  # Initial clauses in saturation        : 3
% 0.34/300.13  # Processed clauses                    : 3
% 0.34/300.13  # ...of these trivial                  : 0
% 0.34/300.13  # ...subsumed                          : 0
% 0.34/300.13  # ...remaining for further processing  : 3
% 0.34/300.13  # Other redundant clauses eliminated   : 0
% 0.34/300.13  # Clauses deleted for lack of memory   : 0
% 0.34/300.13  # Backward-subsumed                    : 0
% 0.34/300.13  # Backward-rewritten                   : 1
% 0.34/300.13  # Generated clauses                    : 0
% 0.34/300.13  # ...of the previous two non-redundant : 0
% 0.34/300.13  # ...aggressively subsumed             : 0
% 0.34/300.13  # Contextual simplify-reflections      : 0
% 0.34/300.13  # Paramodulations                      : 0
% 0.34/300.13  # Factorizations                       : 0
% 0.34/300.13  # NegExts                              : 0
% 0.34/300.13  # Equation resolutions                 : 0
% 0.34/300.13  # Total rewrite steps                  : 2
% 0.34/300.13  # Propositional unsat checks           : 0
% 0.34/300.13  #    Propositional check models        : 0
% 0.34/300.13  #    Propositional check unsatisfiable : 0
% 0.34/300.13  #    Propositional clauses             : 0
% 0.34/300.13  #    Propositional clauses after purity: 0
% 0.34/300.13  #    Propositional unsat core size     : 0
% 0.34/300.13  #    Propositional preprocessing time  : 0.000
% 0.34/300.13  #    Propositional encoding time       : 0.000
% 0.34/300.13  #    Propositional solver time         : 0.000
% 0.34/300.13  #    Success case prop preproc time    : 0.000
% 0.34/300.13  #    Success case prop encoding time   : 0.000
% 0.34/300.13  #    Success case prop solver time     : 0.000
% 0.34/300.13  # Current number of processed clauses  : 2
% 0.34/300.13  #    Positive orientable unit clauses  : 2
% 0.34/300.13  #    Positive unorientable unit clauses: 0
% 0.34/300.13  #    Negative unit clauses             : 0
% 0.34/300.13  #    Non-unit-clauses                  : 0
% 0.34/300.13  # Current number of unprocessed clauses: 0
% 0.34/300.13  # ...number of literals in the above   : 0
% 0.34/300.13  # Current number of archived formulas  : 0
% 0.34/300.13  # Current number of archived clauses   : 1
% 0.34/300.13  # Clause-clause subsumption calls (NU) : 0
% 0.34/300.13  # Rec. Clause-clause subsumption calls : 0
% 0.34/300.13  # Non-unit clause-clause subsumptions  : 0
% 0.34/300.13  # Unit Clause-clause subsumption calls : 0
% 0.34/300.13  # Rewrite failures with RHS unbound    : 0
% 0.34/300.13  # BW rewrite match attempts            : 1
% 0.34/300.13  # BW rewrite match successes           : 1
% 0.34/300.13  # Condensation attempts                : 0
% 0.34/300.13  # Condensation successes               : 0
% 0.34/300.13  # Termbank termtop insertions          : 138
% 0.34/300.13  
% 0.34/300.13  # -------------------------------------------------
% 0.34/300.13  # User time                : 0.003 s
% 0.34/300.13  # System time              : 0.001 s
% 0.34/300.13  # Total time               : 0.004 s
% 0.34/300.13  # Maximum resident set size: 1592 pages
% 0.34/300.13  
% 0.34/300.13  # -------------------------------------------------
% 0.34/300.13  # User time                : 0.004 s
% 0.34/300.13  # System time              : 0.003 s
% 0.34/300.13  # Total time               : 0.007 s
% 0.34/300.13  # Maximum resident set size: 1668 pages
% 0.34/300.13  % E---3.1 exiting
%------------------------------------------------------------------------------