TSTP Solution File: SYN373+1 by E-SAT---3.1.00

View Problem - Process Solution

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

% Computer : n032.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 : 300s
% WCLimit  : 300s
% DateTime : Sat May  4 10:20:13 EDT 2024

% Result   : Theorem 0.13s 0.37s
% Output   : CNFRefutation 0.13s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    1
% Syntax   : Number of formulae    :   10 (   3 unt;   0 def)
%            Number of atoms       :   33 (   0 equ)
%            Maximal formula atoms :   12 (   3 avg)
%            Number of connectives :   35 (  12   ~;  13   |;   4   &)
%                                         (   2 <=>;   4  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   12 (   4 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-1 aty)
%            Number of functors    :    3 (   3 usr;   3 con; 0-0 aty)
%            Number of variables   :   15 (   6 sgn   5   !;   4   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(x2124,conjecture,
    ( ? [X1] :
        ( big_p(X1)
       => big_q(X1) )
  <=> ( ! [X1] : big_p(X1)
     => ? [X1] : big_q(X1) ) ),
    file('/export/starexec/sandbox2/tmp/tmp.E1dTFmgoZz/E---3.1_10552.p',x2124) ).

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

fof(c_0_2,negated_conjecture,
    ! [X2,X3,X4] :
      ( ( big_p(X3)
        | big_p(X2) )
      & ( ~ big_q(X4)
        | big_p(X2) )
      & ( big_p(X3)
        | ~ big_q(X2) )
      & ( ~ big_q(X4)
        | ~ big_q(X2) )
      & ( ~ big_p(esk1_0)
        | big_q(esk1_0)
        | ~ big_p(esk2_0)
        | big_q(esk3_0) ) ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[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,
    ( big_p(X1)
    | big_p(X2) ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

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

cnf(c_0_5,negated_conjecture,
    big_p(X1),
    inference(ef,[status(thm)],[c_0_3]) ).

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

cnf(c_0_7,negated_conjecture,
    ( big_q(esk1_0)
    | big_q(esk3_0) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_4,c_0_5]),c_0_5])]) ).

cnf(c_0_8,negated_conjecture,
    ~ big_q(X1),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_7]),c_0_6]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.08  % Problem    : SYN373+1 : TPTP v8.1.2. Released v2.0.0.
% 0.00/0.09  % Command    : run_E %s %d THM
% 0.09/0.27  % Computer : n032.cluster.edu
% 0.09/0.27  % Model    : x86_64 x86_64
% 0.09/0.27  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.27  % Memory   : 8042.1875MB
% 0.09/0.27  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.09/0.27  % CPULimit   : 300
% 0.09/0.27  % WCLimit    : 300
% 0.09/0.27  % DateTime   : Fri May  3 11:03:24 EDT 2024
% 0.09/0.27  % CPUTime    : 
% 0.13/0.36  Running first-order model finding
% 0.13/0.36  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.E1dTFmgoZz/E---3.1_10552.p
% 0.13/0.37  # Version: 3.1.0
% 0.13/0.37  # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.13/0.37  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.37  # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.13/0.37  # Starting new_bool_3 with 300s (1) cores
% 0.13/0.37  # Starting new_bool_1 with 300s (1) cores
% 0.13/0.37  # Starting sh5l with 300s (1) cores
% 0.13/0.37  # new_bool_1 with pid 10674 completed with status 0
% 0.13/0.37  # Result found by new_bool_1
% 0.13/0.37  # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.13/0.37  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.37  # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.13/0.37  # Starting new_bool_3 with 300s (1) cores
% 0.13/0.37  # Starting new_bool_1 with 300s (1) cores
% 0.13/0.37  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.13/0.37  # Search class: FGHNF-FFSF00-SFFFFFNN
% 0.13/0.37  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.13/0.37  # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.13/0.37  # SAT001_MinMin_p005000_rr_RG with pid 10679 completed with status 0
% 0.13/0.37  # Result found by SAT001_MinMin_p005000_rr_RG
% 0.13/0.37  # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.13/0.37  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.37  # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.13/0.37  # Starting new_bool_3 with 300s (1) cores
% 0.13/0.37  # Starting new_bool_1 with 300s (1) cores
% 0.13/0.37  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.13/0.37  # Search class: FGHNF-FFSF00-SFFFFFNN
% 0.13/0.37  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.13/0.37  # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.13/0.37  # Preprocessing time       : 0.001 s
% 0.13/0.37  # Presaturation interreduction done
% 0.13/0.37  
% 0.13/0.37  # Proof found!
% 0.13/0.37  # SZS status Theorem
% 0.13/0.37  # SZS output start CNFRefutation
% See solution above
% 0.13/0.37  # Parsed axioms                        : 1
% 0.13/0.37  # Removed by relevancy pruning/SinE    : 0
% 0.13/0.37  # Initial clauses                      : 5
% 0.13/0.37  # Removed in clause preprocessing      : 0
% 0.13/0.37  # Initial clauses in saturation        : 5
% 0.13/0.37  # Processed clauses                    : 11
% 0.13/0.37  # ...of these trivial                  : 0
% 0.13/0.37  # ...subsumed                          : 1
% 0.13/0.37  # ...remaining for further processing  : 10
% 0.13/0.37  # Other redundant clauses eliminated   : 0
% 0.13/0.37  # Clauses deleted for lack of memory   : 0
% 0.13/0.37  # Backward-subsumed                    : 3
% 0.13/0.37  # Backward-rewritten                   : 0
% 0.13/0.37  # Generated clauses                    : 5
% 0.13/0.37  # ...of the previous two non-redundant : 3
% 0.13/0.37  # ...aggressively subsumed             : 0
% 0.13/0.37  # Contextual simplify-reflections      : 1
% 0.13/0.37  # Paramodulations                      : 2
% 0.13/0.37  # Factorizations                       : 2
% 0.13/0.37  # NegExts                              : 0
% 0.13/0.37  # Equation resolutions                 : 0
% 0.13/0.37  # Disequality decompositions           : 0
% 0.13/0.37  # Total rewrite steps                  : 3
% 0.13/0.37  # ...of those cached                   : 0
% 0.13/0.37  # Propositional unsat checks           : 0
% 0.13/0.37  #    Propositional check models        : 0
% 0.13/0.37  #    Propositional check unsatisfiable : 0
% 0.13/0.37  #    Propositional clauses             : 0
% 0.13/0.37  #    Propositional clauses after purity: 0
% 0.13/0.37  #    Propositional unsat core size     : 0
% 0.13/0.37  #    Propositional preprocessing time  : 0.000
% 0.13/0.37  #    Propositional encoding time       : 0.000
% 0.13/0.37  #    Propositional solver time         : 0.000
% 0.13/0.37  #    Success case prop preproc time    : 0.000
% 0.13/0.37  #    Success case prop encoding time   : 0.000
% 0.13/0.37  #    Success case prop solver time     : 0.000
% 0.13/0.37  # Current number of processed clauses  : 2
% 0.13/0.37  #    Positive orientable unit clauses  : 1
% 0.13/0.37  #    Positive unorientable unit clauses: 0
% 0.13/0.37  #    Negative unit clauses             : 1
% 0.13/0.37  #    Non-unit-clauses                  : 0
% 0.13/0.37  # Current number of unprocessed clauses: 1
% 0.13/0.37  # ...number of literals in the above   : 1
% 0.13/0.37  # Current number of archived formulas  : 0
% 0.13/0.37  # Current number of archived clauses   : 8
% 0.13/0.37  # Clause-clause subsumption calls (NU) : 2
% 0.13/0.37  # Rec. Clause-clause subsumption calls : 2
% 0.13/0.37  # Non-unit clause-clause subsumptions  : 2
% 0.13/0.37  # Unit Clause-clause subsumption calls : 3
% 0.13/0.37  # Rewrite failures with RHS unbound    : 0
% 0.13/0.37  # BW rewrite match attempts            : 2
% 0.13/0.37  # BW rewrite match successes           : 2
% 0.13/0.37  # Condensation attempts                : 0
% 0.13/0.37  # Condensation successes               : 0
% 0.13/0.37  # Termbank termtop insertions          : 372
% 0.13/0.37  # Search garbage collected termcells   : 104
% 0.13/0.37  
% 0.13/0.37  # -------------------------------------------------
% 0.13/0.37  # User time                : 0.000 s
% 0.13/0.37  # System time              : 0.002 s
% 0.13/0.37  # Total time               : 0.002 s
% 0.13/0.37  # Maximum resident set size: 1580 pages
% 0.13/0.37  
% 0.13/0.37  # -------------------------------------------------
% 0.13/0.37  # User time                : 0.000 s
% 0.13/0.37  # System time              : 0.004 s
% 0.13/0.37  # Total time               : 0.004 s
% 0.13/0.37  # Maximum resident set size: 1688 pages
% 0.13/0.37  % E---3.1 exiting
%------------------------------------------------------------------------------