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

View Problem - Process Solution

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

% Computer : n031.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:13:16 EDT 2023

% Result   : Theorem 0.20s 0.47s
% Output   : CNFRefutation 0.20s
% 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 :    7 (   3 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-1 aty)
%            Number of functors    :    2 (   2 usr;   2 con; 0-0 aty)
%            Number of variables   :   10 (   2 sgn;   6   !;   2   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(pel19,conjecture,
    ? [X1] :
    ! [X2,X3] :
      ( ( big_p(X2)
       => big_q(X3) )
     => ( big_p(X1)
       => big_q(X1) ) ),
    file('/export/starexec/sandbox/tmp/tmp.Nu4ATpmHhr/E---3.1_28713.p',pel19) ).

fof(c_0_1,negated_conjecture,
    ~ ? [X1] :
      ! [X2,X3] :
        ( ( big_p(X2)
         => big_q(X3) )
       => ( big_p(X1)
         => big_q(X1) ) ),
    inference(assume_negation,[status(cth)],[pel19]) ).

fof(c_0_2,negated_conjecture,
    ! [X6,X7] :
      ( ( ~ big_p(esk1_0)
        | big_q(esk2_0) )
      & big_p(X6)
      & ~ big_q(X7) ),
    inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_1])])])])]) ).

cnf(c_0_3,negated_conjecture,
    ( big_q(esk2_0)
    | ~ big_p(esk1_0) ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

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

cnf(c_0_5,negated_conjecture,
    big_q(esk2_0),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_3,c_0_4])]) ).

cnf(c_0_6,negated_conjecture,
    ~ big_q(X1),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem    : SYN049+1 : TPTP v8.1.2. Released v2.0.0.
% 0.07/0.13  % Command    : run_E %s %d THM
% 0.14/0.34  % Computer : n031.cluster.edu
% 0.14/0.34  % Model    : x86_64 x86_64
% 0.14/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34  % Memory   : 8042.1875MB
% 0.14/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34  % CPULimit   : 2400
% 0.14/0.34  % WCLimit    : 300
% 0.14/0.34  % DateTime   : Mon Oct  2 19:15:43 EDT 2023
% 0.14/0.34  % CPUTime    : 
% 0.20/0.46  Running first-order theorem proving
% 0.20/0.47  Running: /export/starexec/sandbox/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/sandbox/tmp/tmp.Nu4ATpmHhr/E---3.1_28713.p
% 0.20/0.47  # Version: 3.1pre001
% 0.20/0.47  # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.20/0.47  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.47  # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.20/0.47  # Starting new_bool_3 with 300s (1) cores
% 0.20/0.47  # Starting new_bool_1 with 300s (1) cores
% 0.20/0.47  # Starting sh5l with 300s (1) cores
% 0.20/0.47  # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 28791 completed with status 0
% 0.20/0.47  # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.20/0.47  # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.20/0.47  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.47  # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.20/0.47  # No SInE strategy applied
% 0.20/0.47  # Search class: FUUNF-FFSF00-SFFFFFNN
% 0.20/0.47  # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.47  # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.20/0.47  # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.20/0.47  # Starting new_bool_3 with 136s (1) cores
% 0.20/0.47  # Starting new_bool_1 with 136s (1) cores
% 0.20/0.47  # Starting sh5l with 136s (1) cores
% 0.20/0.47  # sh5l with pid 28799 completed with status 0
% 0.20/0.47  # Result found by sh5l
% 0.20/0.47  # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.20/0.47  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.47  # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.20/0.47  # No SInE strategy applied
% 0.20/0.47  # Search class: FUUNF-FFSF00-SFFFFFNN
% 0.20/0.47  # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.47  # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.20/0.47  # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.20/0.47  # Starting new_bool_3 with 136s (1) cores
% 0.20/0.47  # Starting new_bool_1 with 136s (1) cores
% 0.20/0.47  # Starting sh5l with 136s (1) cores
% 0.20/0.47  # Preprocessing time       : 0.001 s
% 0.20/0.47  # Presaturation interreduction done
% 0.20/0.47  
% 0.20/0.47  # Proof found!
% 0.20/0.47  # SZS status Theorem
% 0.20/0.47  # SZS output start CNFRefutation
% See solution above
% 0.20/0.47  # Parsed axioms                        : 1
% 0.20/0.47  # Removed by relevancy pruning/SinE    : 0
% 0.20/0.47  # Initial clauses                      : 3
% 0.20/0.47  # Removed in clause preprocessing      : 1
% 0.20/0.48  # Initial clauses in saturation        : 2
% 0.20/0.48  # Processed clauses                    : 2
% 0.20/0.48  # ...of these trivial                  : 0
% 0.20/0.48  # ...subsumed                          : 0
% 0.20/0.48  # ...remaining for further processing  : 2
% 0.20/0.48  # Other redundant clauses eliminated   : 0
% 0.20/0.48  # Clauses deleted for lack of memory   : 0
% 0.20/0.48  # Backward-subsumed                    : 0
% 0.20/0.48  # Backward-rewritten                   : 0
% 0.20/0.48  # Generated clauses                    : 1
% 0.20/0.48  # ...of the previous two non-redundant : 0
% 0.20/0.48  # ...aggressively subsumed             : 0
% 0.20/0.48  # Contextual simplify-reflections      : 0
% 0.20/0.48  # Paramodulations                      : 0
% 0.20/0.48  # Factorizations                       : 0
% 0.20/0.48  # NegExts                              : 0
% 0.20/0.48  # Equation resolutions                 : 0
% 0.20/0.48  # Total rewrite steps                  : 0
% 0.20/0.48  # Propositional unsat checks           : 0
% 0.20/0.48  #    Propositional check models        : 0
% 0.20/0.48  #    Propositional check unsatisfiable : 0
% 0.20/0.48  #    Propositional clauses             : 0
% 0.20/0.48  #    Propositional clauses after purity: 0
% 0.20/0.48  #    Propositional unsat core size     : 0
% 0.20/0.48  #    Propositional preprocessing time  : 0.000
% 0.20/0.48  #    Propositional encoding time       : 0.000
% 0.20/0.48  #    Propositional solver time         : 0.000
% 0.20/0.48  #    Success case prop preproc time    : 0.000
% 0.20/0.48  #    Success case prop encoding time   : 0.000
% 0.20/0.48  #    Success case prop solver time     : 0.000
% 0.20/0.48  # Current number of processed clauses  : 1
% 0.20/0.48  #    Positive orientable unit clauses  : 0
% 0.20/0.48  #    Positive unorientable unit clauses: 0
% 0.20/0.48  #    Negative unit clauses             : 1
% 0.20/0.48  #    Non-unit-clauses                  : 0
% 0.20/0.48  # Current number of unprocessed clauses: 0
% 0.20/0.48  # ...number of literals in the above   : 0
% 0.20/0.48  # Current number of archived formulas  : 0
% 0.20/0.48  # Current number of archived clauses   : 2
% 0.20/0.48  # Clause-clause subsumption calls (NU) : 0
% 0.20/0.48  # Rec. Clause-clause subsumption calls : 0
% 0.20/0.48  # Non-unit clause-clause subsumptions  : 0
% 0.20/0.48  # Unit Clause-clause subsumption calls : 0
% 0.20/0.48  # Rewrite failures with RHS unbound    : 0
% 0.20/0.48  # BW rewrite match attempts            : 0
% 0.20/0.48  # BW rewrite match successes           : 0
% 0.20/0.48  # Condensation attempts                : 2
% 0.20/0.48  # Condensation successes               : 0
% 0.20/0.48  # Termbank termtop insertions          : 147
% 0.20/0.48  
% 0.20/0.48  # -------------------------------------------------
% 0.20/0.48  # User time                : 0.001 s
% 0.20/0.48  # System time              : 0.002 s
% 0.20/0.48  # Total time               : 0.003 s
% 0.20/0.48  # Maximum resident set size: 1700 pages
% 0.20/0.48  
% 0.20/0.48  # -------------------------------------------------
% 0.20/0.48  # User time                : 0.005 s
% 0.20/0.48  # System time              : 0.008 s
% 0.20/0.48  # Total time               : 0.013 s
% 0.20/0.48  # Maximum resident set size: 1664 pages
% 0.20/0.48  % E---3.1 exiting
% 0.20/0.48  % E---3.1 exiting
%------------------------------------------------------------------------------