TSTP Solution File: SET803+4 by E-SAT---3.1.00

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E-SAT---3.1.00
% Problem  : SET803+4 : TPTP v8.2.0. Released v3.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E %s %d THM

% Computer : n023.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 02:59:55 EDT 2024

% Result   : Theorem 0.21s 0.51s
% Output   : CNFRefutation 0.21s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   24 (   9 unt;   0 def)
%            Number of atoms       :   80 (  11 equ)
%            Maximal formula atoms :   15 (   3 avg)
%            Number of connectives :   90 (  34   ~;  30   |;  18   &)
%                                         (   2 <=>;   6  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   15 (   5 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    7 (   5 usr;   1 prp; 0-3 aty)
%            Number of functors    :    7 (   7 usr;   5 con; 0-3 aty)
%            Number of variables   :   50 (   2 sgn  30   !;   2   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(thIV15,conjecture,
    ! [X1,X2] :
      ( order(X1,X2)
     => ! [X8,X9] :
          ( ( max(X8,X1,X2)
            & max(X9,X1,X2)
            & X8 != X9 )
         => ~ ? [X6] : greatest(X6,X1,X2) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',thIV15) ).

fof(max,axiom,
    ! [X1,X2,X6] :
      ( max(X6,X1,X2)
    <=> ( member(X6,X2)
        & ! [X3] :
            ( ( member(X3,X2)
              & apply(X1,X6,X3) )
           => X6 = X3 ) ) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SET006+3.ax',max) ).

fof(greatest,axiom,
    ! [X1,X2,X6] :
      ( greatest(X6,X1,X2)
    <=> ( member(X6,X2)
        & ! [X3] :
            ( member(X3,X2)
           => apply(X1,X3,X6) ) ) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SET006+3.ax',greatest) ).

fof(c_0_3,negated_conjecture,
    ~ ! [X1,X2] :
        ( order(X1,X2)
       => ! [X8,X9] :
            ( ( max(X8,X1,X2)
              & max(X9,X1,X2)
              & X8 != X9 )
           => ~ ? [X6] : greatest(X6,X1,X2) ) ),
    inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[thIV15])]) ).

fof(c_0_4,plain,
    ! [X23,X24,X25,X26,X27,X28,X29] :
      ( ( member(X25,X24)
        | ~ max(X25,X23,X24) )
      & ( ~ member(X26,X24)
        | ~ apply(X23,X25,X26)
        | X25 = X26
        | ~ max(X25,X23,X24) )
      & ( member(esk7_3(X27,X28,X29),X28)
        | ~ member(X29,X28)
        | max(X29,X27,X28) )
      & ( apply(X27,X29,esk7_3(X27,X28,X29))
        | ~ member(X29,X28)
        | max(X29,X27,X28) )
      & ( X29 != esk7_3(X27,X28,X29)
        | ~ member(X29,X28)
        | max(X29,X27,X28) ) ),
    inference(distribute,[status(thm)],[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)],[max])])])])])])]) ).

fof(c_0_5,negated_conjecture,
    ( order(esk1_0,esk2_0)
    & max(esk3_0,esk1_0,esk2_0)
    & max(esk4_0,esk1_0,esk2_0)
    & esk3_0 != esk4_0
    & greatest(esk5_0,esk1_0,esk2_0) ),
    inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])])]) ).

fof(c_0_6,plain,
    ! [X15,X16,X17,X18,X19,X20,X21] :
      ( ( member(X17,X16)
        | ~ greatest(X17,X15,X16) )
      & ( ~ member(X18,X16)
        | apply(X15,X18,X17)
        | ~ greatest(X17,X15,X16) )
      & ( member(esk6_3(X19,X20,X21),X20)
        | ~ member(X21,X20)
        | greatest(X21,X19,X20) )
      & ( ~ apply(X19,esk6_3(X19,X20,X21),X21)
        | ~ member(X21,X20)
        | greatest(X21,X19,X20) ) ),
    inference(distribute,[status(thm)],[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)],[greatest])])])])])])]) ).

cnf(c_0_7,plain,
    ( X4 = X1
    | ~ member(X1,X2)
    | ~ apply(X3,X4,X1)
    | ~ max(X4,X3,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

cnf(c_0_8,negated_conjecture,
    max(esk4_0,esk1_0,esk2_0),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

cnf(c_0_9,plain,
    ( apply(X3,X1,X4)
    | ~ member(X1,X2)
    | ~ greatest(X4,X3,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

cnf(c_0_10,negated_conjecture,
    greatest(esk5_0,esk1_0,esk2_0),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

cnf(c_0_11,plain,
    ( member(X1,X2)
    | ~ greatest(X1,X3,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

cnf(c_0_12,plain,
    ( member(X1,X2)
    | ~ max(X1,X3,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

cnf(c_0_13,negated_conjecture,
    ( X1 = esk4_0
    | ~ apply(esk1_0,esk4_0,X1)
    | ~ member(X1,esk2_0) ),
    inference(spm,[status(thm)],[c_0_7,c_0_8]) ).

cnf(c_0_14,negated_conjecture,
    ( apply(esk1_0,X1,esk5_0)
    | ~ member(X1,esk2_0) ),
    inference(spm,[status(thm)],[c_0_9,c_0_10]) ).

cnf(c_0_15,negated_conjecture,
    member(esk5_0,esk2_0),
    inference(spm,[status(thm)],[c_0_11,c_0_10]) ).

cnf(c_0_16,negated_conjecture,
    member(esk4_0,esk2_0),
    inference(spm,[status(thm)],[c_0_12,c_0_8]) ).

cnf(c_0_17,negated_conjecture,
    max(esk3_0,esk1_0,esk2_0),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

cnf(c_0_18,negated_conjecture,
    esk5_0 = esk4_0,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_15]),c_0_16])]) ).

cnf(c_0_19,negated_conjecture,
    ( X1 = esk3_0
    | ~ apply(esk1_0,esk3_0,X1)
    | ~ member(X1,esk2_0) ),
    inference(spm,[status(thm)],[c_0_7,c_0_17]) ).

cnf(c_0_20,negated_conjecture,
    ( apply(esk1_0,X1,esk4_0)
    | ~ member(X1,esk2_0) ),
    inference(rw,[status(thm)],[c_0_14,c_0_18]) ).

cnf(c_0_21,negated_conjecture,
    member(esk3_0,esk2_0),
    inference(spm,[status(thm)],[c_0_12,c_0_17]) ).

cnf(c_0_22,negated_conjecture,
    esk3_0 != esk4_0,
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12  % Problem    : SET803+4 : TPTP v8.2.0. Released v3.2.0.
% 0.06/0.14  % Command    : run_E %s %d THM
% 0.14/0.35  % Computer : n023.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   : 300
% 0.14/0.35  % WCLimit    : 300
% 0.14/0.35  % DateTime   : Mon May 20 13:11:23 EDT 2024
% 0.14/0.35  % CPUTime    : 
% 0.21/0.49  Running first-order model finding
% 0.21/0.49  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/benchmark/theBenchmark.p
% 0.21/0.51  # Version: 3.1.0
% 0.21/0.51  # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.51  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.51  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.51  # Starting new_bool_3 with 300s (1) cores
% 0.21/0.51  # Starting new_bool_1 with 300s (1) cores
% 0.21/0.51  # Starting sh5l with 300s (1) cores
% 0.21/0.51  # sh5l with pid 26728 completed with status 0
% 0.21/0.51  # Result found by sh5l
% 0.21/0.51  # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.51  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.51  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.51  # Starting new_bool_3 with 300s (1) cores
% 0.21/0.51  # Starting new_bool_1 with 300s (1) cores
% 0.21/0.51  # Starting sh5l with 300s (1) cores
% 0.21/0.51  # SinE strategy is gf500_gu_R04_F100_L20000
% 0.21/0.51  # Search class: FGUSF-FFLS32-SFFFFFNN
% 0.21/0.51  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.51  # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.21/0.51  # SAT001_MinMin_p005000_rr_RG with pid 26734 completed with status 0
% 0.21/0.51  # Result found by SAT001_MinMin_p005000_rr_RG
% 0.21/0.51  # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.51  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.51  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.51  # Starting new_bool_3 with 300s (1) cores
% 0.21/0.51  # Starting new_bool_1 with 300s (1) cores
% 0.21/0.51  # Starting sh5l with 300s (1) cores
% 0.21/0.51  # SinE strategy is gf500_gu_R04_F100_L20000
% 0.21/0.51  # Search class: FGUSF-FFLS32-SFFFFFNN
% 0.21/0.51  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.51  # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.21/0.51  # Preprocessing time       : 0.001 s
% 0.21/0.51  # Presaturation interreduction done
% 0.21/0.51  
% 0.21/0.51  # Proof found!
% 0.21/0.51  # SZS status Theorem
% 0.21/0.51  # SZS output start CNFRefutation
% See solution above
% 0.21/0.51  # Parsed axioms                        : 11
% 0.21/0.51  # Removed by relevancy pruning/SinE    : 2
% 0.21/0.51  # Initial clauses                      : 103
% 0.21/0.51  # Removed in clause preprocessing      : 0
% 0.21/0.51  # Initial clauses in saturation        : 103
% 0.21/0.51  # Processed clauses                    : 147
% 0.21/0.51  # ...of these trivial                  : 0
% 0.21/0.51  # ...subsumed                          : 0
% 0.21/0.51  # ...remaining for further processing  : 147
% 0.21/0.51  # Other redundant clauses eliminated   : 0
% 0.21/0.51  # Clauses deleted for lack of memory   : 0
% 0.21/0.51  # Backward-subsumed                    : 0
% 0.21/0.51  # Backward-rewritten                   : 3
% 0.21/0.51  # Generated clauses                    : 20
% 0.21/0.51  # ...of the previous two non-redundant : 19
% 0.21/0.51  # ...aggressively subsumed             : 0
% 0.21/0.51  # Contextual simplify-reflections      : 0
% 0.21/0.51  # Paramodulations                      : 20
% 0.21/0.51  # Factorizations                       : 0
% 0.21/0.51  # NegExts                              : 0
% 0.21/0.51  # Equation resolutions                 : 0
% 0.21/0.51  # Disequality decompositions           : 0
% 0.21/0.51  # Total rewrite steps                  : 11
% 0.21/0.51  # ...of those cached                   : 7
% 0.21/0.51  # Propositional unsat checks           : 0
% 0.21/0.51  #    Propositional check models        : 0
% 0.21/0.51  #    Propositional check unsatisfiable : 0
% 0.21/0.51  #    Propositional clauses             : 0
% 0.21/0.51  #    Propositional clauses after purity: 0
% 0.21/0.51  #    Propositional unsat core size     : 0
% 0.21/0.51  #    Propositional preprocessing time  : 0.000
% 0.21/0.51  #    Propositional encoding time       : 0.000
% 0.21/0.51  #    Propositional solver time         : 0.000
% 0.21/0.51  #    Success case prop preproc time    : 0.000
% 0.21/0.51  #    Success case prop encoding time   : 0.000
% 0.21/0.51  #    Success case prop solver time     : 0.000
% 0.21/0.51  # Current number of processed clauses  : 41
% 0.21/0.51  #    Positive orientable unit clauses  : 8
% 0.21/0.51  #    Positive unorientable unit clauses: 0
% 0.21/0.51  #    Negative unit clauses             : 1
% 0.21/0.51  #    Non-unit-clauses                  : 32
% 0.21/0.51  # Current number of unprocessed clauses: 74
% 0.21/0.51  # ...number of literals in the above   : 295
% 0.21/0.51  # Current number of archived formulas  : 0
% 0.21/0.51  # Current number of archived clauses   : 106
% 0.21/0.51  # Clause-clause subsumption calls (NU) : 3238
% 0.21/0.51  # Rec. Clause-clause subsumption calls : 1577
% 0.21/0.51  # Non-unit clause-clause subsumptions  : 0
% 0.21/0.51  # Unit Clause-clause subsumption calls : 31
% 0.21/0.51  # Rewrite failures with RHS unbound    : 0
% 0.21/0.51  # BW rewrite match attempts            : 1
% 0.21/0.51  # BW rewrite match successes           : 1
% 0.21/0.51  # Condensation attempts                : 0
% 0.21/0.51  # Condensation successes               : 0
% 0.21/0.51  # Termbank termtop insertions          : 7309
% 0.21/0.51  # Search garbage collected termcells   : 1497
% 0.21/0.51  
% 0.21/0.51  # -------------------------------------------------
% 0.21/0.51  # User time                : 0.013 s
% 0.21/0.51  # System time              : 0.001 s
% 0.21/0.51  # Total time               : 0.014 s
% 0.21/0.51  # Maximum resident set size: 2052 pages
% 0.21/0.51  
% 0.21/0.51  # -------------------------------------------------
% 0.21/0.51  # User time                : 0.013 s
% 0.21/0.51  # System time              : 0.003 s
% 0.21/0.51  # Total time               : 0.016 s
% 0.21/0.51  # Maximum resident set size: 1716 pages
% 0.21/0.51  % E---3.1 exiting
%------------------------------------------------------------------------------