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

View Problem - Process Solution

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

% Computer : n024.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 : Tue May 21 07:56:59 EDT 2024

% Result   : Theorem 0.19s 0.49s
% Output   : CNFRefutation 0.19s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    2
% Syntax   : Number of formulae    :   23 (   3 unt;   0 def)
%            Number of atoms       :   78 (   6 equ)
%            Maximal formula atoms :   15 (   3 avg)
%            Number of connectives :  100 (  45   ~;  41   |;   9   &)
%                                         (   3 <=>;   2  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   13 (   5 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   1 con; 0-2 aty)
%            Number of variables   :   51 (   0 sgn  13   !;   7   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(pel54,conjecture,
    ~ ? [X4] :
      ! [X3] :
        ( big_f(X3,X4)
      <=> ! [X5] :
            ( big_f(X3,X5)
           => ? [X1] :
                ( big_f(X1,X5)
                & ~ ? [X2] :
                      ( big_f(X2,X5)
                      & big_f(X2,X1) ) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',pel54) ).

fof(pel54_1,axiom,
    ! [X1] :
    ? [X2] :
    ! [X3] :
      ( big_f(X3,X2)
    <=> X3 = X1 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',pel54_1) ).

fof(c_0_2,negated_conjecture,
    ~ ~ ? [X4] :
        ! [X3] :
          ( big_f(X3,X4)
        <=> ! [X5] :
              ( big_f(X3,X5)
             => ? [X1] :
                  ( big_f(X1,X5)
                  & ~ ? [X2] :
                        ( big_f(X2,X5)
                        & big_f(X2,X1) ) ) ) ),
    inference(assume_negation,[status(cth)],[pel54]) ).

fof(c_0_3,negated_conjecture,
    ! [X7,X8,X10,X12] :
      ( ( big_f(esk2_2(X7,X8),X8)
        | ~ big_f(X7,X8)
        | ~ big_f(X7,esk1_0) )
      & ( ~ big_f(X10,X8)
        | ~ big_f(X10,esk2_2(X7,X8))
        | ~ big_f(X7,X8)
        | ~ big_f(X7,esk1_0) )
      & ( big_f(X7,esk3_1(X7))
        | big_f(X7,esk1_0) )
      & ( big_f(esk4_2(X7,X12),esk3_1(X7))
        | ~ big_f(X12,esk3_1(X7))
        | big_f(X7,esk1_0) )
      & ( big_f(esk4_2(X7,X12),X12)
        | ~ big_f(X12,esk3_1(X7))
        | big_f(X7,esk1_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_2])])])])])]) ).

fof(c_0_4,plain,
    ! [X14,X16,X17] :
      ( ( ~ big_f(X16,esk5_1(X14))
        | X16 = X14 )
      & ( X17 != X14
        | big_f(X17,esk5_1(X14)) ) ),
    inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[pel54_1])])])])])]) ).

cnf(c_0_5,negated_conjecture,
    ( ~ big_f(X1,X2)
    | ~ big_f(X1,esk2_2(X3,X2))
    | ~ big_f(X3,X2)
    | ~ big_f(X3,esk1_0) ),
    inference(split_conjunct,[status(thm)],[c_0_3]) ).

cnf(c_0_6,negated_conjecture,
    ( big_f(esk4_2(X1,X2),X2)
    | big_f(X1,esk1_0)
    | ~ big_f(X2,esk3_1(X1)) ),
    inference(split_conjunct,[status(thm)],[c_0_3]) ).

cnf(c_0_7,plain,
    ( X1 = X2
    | ~ big_f(X1,esk5_1(X2)) ),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

cnf(c_0_8,negated_conjecture,
    ( big_f(esk2_2(X1,X2),X2)
    | ~ big_f(X1,X2)
    | ~ big_f(X1,esk1_0) ),
    inference(split_conjunct,[status(thm)],[c_0_3]) ).

cnf(c_0_9,negated_conjecture,
    ( big_f(X1,esk1_0)
    | ~ big_f(esk4_2(X1,esk2_2(X2,X3)),X3)
    | ~ big_f(esk2_2(X2,X3),esk3_1(X1))
    | ~ big_f(X2,esk1_0)
    | ~ big_f(X2,X3) ),
    inference(spm,[status(thm)],[c_0_5,c_0_6]) ).

cnf(c_0_10,negated_conjecture,
    ( big_f(esk4_2(X1,X2),esk3_1(X1))
    | big_f(X1,esk1_0)
    | ~ big_f(X2,esk3_1(X1)) ),
    inference(split_conjunct,[status(thm)],[c_0_3]) ).

cnf(c_0_11,negated_conjecture,
    ( esk2_2(X1,esk5_1(X2)) = X2
    | ~ big_f(X1,esk5_1(X2))
    | ~ big_f(X1,esk1_0) ),
    inference(spm,[status(thm)],[c_0_7,c_0_8]) ).

cnf(c_0_12,plain,
    ( big_f(X1,esk5_1(X2))
    | X1 != X2 ),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

cnf(c_0_13,negated_conjecture,
    ( big_f(X1,esk1_0)
    | ~ big_f(X2,esk3_1(X1))
    | ~ big_f(X2,esk1_0) ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_8]) ).

cnf(c_0_14,negated_conjecture,
    ( ~ big_f(X1,esk5_1(X2))
    | ~ big_f(X3,esk5_1(X2))
    | ~ big_f(X1,esk1_0)
    | ~ big_f(X3,X2) ),
    inference(spm,[status(thm)],[c_0_5,c_0_11]) ).

cnf(c_0_15,plain,
    big_f(X1,esk5_1(X1)),
    inference(er,[status(thm)],[c_0_12]) ).

cnf(c_0_16,negated_conjecture,
    ( big_f(X1,esk1_0)
    | ~ big_f(esk4_2(X1,X2),esk1_0)
    | ~ big_f(X2,esk3_1(X1)) ),
    inference(spm,[status(thm)],[c_0_13,c_0_10]) ).

cnf(c_0_17,negated_conjecture,
    ( ~ big_f(X1,esk5_1(X2))
    | ~ big_f(X2,esk1_0)
    | ~ big_f(X1,X2) ),
    inference(spm,[status(thm)],[c_0_14,c_0_15]) ).

cnf(c_0_18,negated_conjecture,
    ( big_f(X1,esk1_0)
    | ~ big_f(esk1_0,esk3_1(X1)) ),
    inference(spm,[status(thm)],[c_0_16,c_0_6]) ).

cnf(c_0_19,negated_conjecture,
    ( big_f(X1,esk3_1(X1))
    | big_f(X1,esk1_0) ),
    inference(split_conjunct,[status(thm)],[c_0_3]) ).

cnf(c_0_20,negated_conjecture,
    ( ~ big_f(X1,esk1_0)
    | ~ big_f(X1,X1) ),
    inference(spm,[status(thm)],[c_0_17,c_0_15]) ).

cnf(c_0_21,negated_conjecture,
    big_f(esk1_0,esk1_0),
    inference(spm,[status(thm)],[c_0_18,c_0_19]) ).

cnf(c_0_22,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_21])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.12  % Problem    : SYN077+1 : TPTP v8.2.0. Released v2.0.0.
% 0.09/0.13  % Command    : run_E %s %d THM
% 0.13/0.35  % Computer : n024.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   : 300
% 0.13/0.35  % WCLimit    : 300
% 0.13/0.35  % DateTime   : Mon May 20 15:26:22 EDT 2024
% 0.13/0.35  % CPUTime    : 
% 0.19/0.48  Running first-order model finding
% 0.19/0.48  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/benchmark/theBenchmark.p
% 0.19/0.49  # Version: 3.1.0
% 0.19/0.49  # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.19/0.49  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.49  # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.19/0.49  # Starting new_bool_3 with 300s (1) cores
% 0.19/0.49  # Starting new_bool_1 with 300s (1) cores
% 0.19/0.49  # Starting sh5l with 300s (1) cores
% 0.19/0.49  # new_bool_3 with pid 25072 completed with status 0
% 0.19/0.49  # Result found by new_bool_3
% 0.19/0.49  # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.19/0.49  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.49  # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.19/0.49  # Starting new_bool_3 with 300s (1) cores
% 0.19/0.49  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.19/0.49  # Search class: FGHSF-FFSF21-SFFFFFNN
% 0.19/0.49  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.49  # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.19/0.49  # SAT001_MinMin_p005000_rr_RG with pid 25076 completed with status 0
% 0.19/0.49  # Result found by SAT001_MinMin_p005000_rr_RG
% 0.19/0.49  # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.19/0.49  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.49  # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.19/0.49  # Starting new_bool_3 with 300s (1) cores
% 0.19/0.49  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.19/0.49  # Search class: FGHSF-FFSF21-SFFFFFNN
% 0.19/0.49  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.49  # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.19/0.49  # Preprocessing time       : 0.001 s
% 0.19/0.49  # Presaturation interreduction done
% 0.19/0.49  
% 0.19/0.49  # Proof found!
% 0.19/0.49  # SZS status Theorem
% 0.19/0.49  # SZS output start CNFRefutation
% See solution above
% 0.19/0.49  # Parsed axioms                        : 2
% 0.19/0.49  # Removed by relevancy pruning/SinE    : 0
% 0.19/0.49  # Initial clauses                      : 7
% 0.19/0.49  # Removed in clause preprocessing      : 0
% 0.19/0.49  # Initial clauses in saturation        : 7
% 0.19/0.49  # Processed clauses                    : 44
% 0.19/0.49  # ...of these trivial                  : 0
% 0.19/0.49  # ...subsumed                          : 3
% 0.19/0.49  # ...remaining for further processing  : 41
% 0.19/0.49  # Other redundant clauses eliminated   : 1
% 0.19/0.49  # Clauses deleted for lack of memory   : 0
% 0.19/0.49  # Backward-subsumed                    : 2
% 0.19/0.49  # Backward-rewritten                   : 0
% 0.19/0.49  # Generated clauses                    : 42
% 0.19/0.49  # ...of the previous two non-redundant : 38
% 0.19/0.49  # ...aggressively subsumed             : 0
% 0.19/0.49  # Contextual simplify-reflections      : 1
% 0.19/0.49  # Paramodulations                      : 41
% 0.19/0.49  # Factorizations                       : 0
% 0.19/0.49  # NegExts                              : 0
% 0.19/0.49  # Equation resolutions                 : 1
% 0.19/0.49  # Disequality decompositions           : 0
% 0.19/0.49  # Total rewrite steps                  : 3
% 0.19/0.49  # ...of those cached                   : 1
% 0.19/0.49  # Propositional unsat checks           : 0
% 0.19/0.49  #    Propositional check models        : 0
% 0.19/0.49  #    Propositional check unsatisfiable : 0
% 0.19/0.49  #    Propositional clauses             : 0
% 0.19/0.49  #    Propositional clauses after purity: 0
% 0.19/0.49  #    Propositional unsat core size     : 0
% 0.19/0.49  #    Propositional preprocessing time  : 0.000
% 0.19/0.49  #    Propositional encoding time       : 0.000
% 0.19/0.49  #    Propositional solver time         : 0.000
% 0.19/0.49  #    Success case prop preproc time    : 0.000
% 0.19/0.49  #    Success case prop encoding time   : 0.000
% 0.19/0.49  #    Success case prop solver time     : 0.000
% 0.19/0.49  # Current number of processed clauses  : 31
% 0.19/0.49  #    Positive orientable unit clauses  : 2
% 0.19/0.49  #    Positive unorientable unit clauses: 0
% 0.19/0.49  #    Negative unit clauses             : 0
% 0.19/0.49  #    Non-unit-clauses                  : 29
% 0.19/0.49  # Current number of unprocessed clauses: 8
% 0.19/0.49  # ...number of literals in the above   : 25
% 0.19/0.49  # Current number of archived formulas  : 0
% 0.19/0.49  # Current number of archived clauses   : 9
% 0.19/0.49  # Clause-clause subsumption calls (NU) : 241
% 0.19/0.49  # Rec. Clause-clause subsumption calls : 121
% 0.19/0.49  # Non-unit clause-clause subsumptions  : 6
% 0.19/0.49  # Unit Clause-clause subsumption calls : 0
% 0.19/0.49  # Rewrite failures with RHS unbound    : 0
% 0.19/0.49  # BW rewrite match attempts            : 2
% 0.19/0.49  # BW rewrite match successes           : 0
% 0.19/0.49  # Condensation attempts                : 0
% 0.19/0.49  # Condensation successes               : 0
% 0.19/0.49  # Termbank termtop insertions          : 1581
% 0.19/0.49  # Search garbage collected termcells   : 180
% 0.19/0.49  
% 0.19/0.49  # -------------------------------------------------
% 0.19/0.49  # User time                : 0.004 s
% 0.19/0.49  # System time              : 0.002 s
% 0.19/0.49  # Total time               : 0.006 s
% 0.19/0.49  # Maximum resident set size: 1732 pages
% 0.19/0.49  
% 0.19/0.49  # -------------------------------------------------
% 0.19/0.49  # User time                : 0.007 s
% 0.19/0.49  # System time              : 0.002 s
% 0.19/0.49  # Total time               : 0.009 s
% 0.19/0.49  # Maximum resident set size: 1688 pages
% 0.19/0.49  % E---3.1 exiting
%------------------------------------------------------------------------------