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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E-SAT---3.1
% Problem  : SYN327+1 : TPTP v8.1.2. Released v2.0.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 20:29:55 EDT 2023

% Result   : Theorem 0.20s 0.49s
% Output   : CNFRefutation 0.20s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    1
% Syntax   : Number of formulae    :    7 (   2 unt;   0 def)
%            Number of atoms       :   36 (   0 equ)
%            Maximal formula atoms :   15 (   5 avg)
%            Number of connectives :   46 (  17   ~;  11   |;  10   &)
%                                         (   0 <=>;   8  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   11 (   6 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    2 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :    2 (   2 usr;   1 con; 0-1 aty)
%            Number of variables   :   10 (   1 sgn;   5   !;   2   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(church_46_12_2,conjecture,
    ! [X1] :
    ? [X2] :
    ! [X3] :
      ( big_f(X2,X1)
     => ( ( big_f(X1,X3)
         => big_f(X1,X2) )
        & ( big_f(X1,X2)
         => ( ~ big_f(X1,X3)
           => ( big_f(X2,X1)
              & big_f(X3,X2) ) ) ) ) ),
    file('/export/starexec/sandbox2/tmp/tmp.phyGWkLGtM/E---3.1_15077.p',church_46_12_2) ).

fof(c_0_1,negated_conjecture,
    ~ ! [X1] :
      ? [X2] :
      ! [X3] :
        ( big_f(X2,X1)
       => ( ( big_f(X1,X3)
           => big_f(X1,X2) )
          & ( big_f(X1,X2)
           => ( ~ big_f(X1,X3)
             => ( big_f(X2,X1)
                & big_f(X3,X2) ) ) ) ) ),
    inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[church_46_12_2])]) ).

fof(c_0_2,negated_conjecture,
    ! [X5] :
      ( big_f(X5,esk1_0)
      & ( big_f(esk1_0,X5)
        | big_f(esk1_0,esk2_1(X5)) )
      & ( ~ big_f(esk1_0,esk2_1(X5))
        | big_f(esk1_0,esk2_1(X5)) )
      & ( ~ big_f(X5,esk1_0)
        | ~ big_f(esk2_1(X5),X5)
        | big_f(esk1_0,esk2_1(X5)) )
      & ( big_f(esk1_0,X5)
        | ~ big_f(esk1_0,X5) )
      & ( ~ big_f(esk1_0,esk2_1(X5))
        | ~ big_f(esk1_0,X5) )
      & ( ~ big_f(X5,esk1_0)
        | ~ big_f(esk2_1(X5),X5)
        | ~ big_f(esk1_0,X5) ) ),
    inference(distribute,[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_f(X1,esk1_0)
    | ~ big_f(esk2_1(X1),X1)
    | ~ big_f(esk1_0,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

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

cnf(c_0_5,negated_conjecture,
    ( ~ big_f(esk2_1(X1),X1)
    | ~ big_f(esk1_0,X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_3,c_0_4])]) ).

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

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