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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E---3.1
% Problem  : SET020+1 : TPTP v8.1.2. Bugfixed v5.4.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E %s %d THM

% Computer : n027.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 19:17:58 EDT 2023

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

% Comments : 
%------------------------------------------------------------------------------
fof(unique_1st_and_2nd_in_pair_of_sets1,conjecture,
    ! [X3,X4,X1] :
      ( ( member(X3,universal_class)
        & member(X4,universal_class)
        & X1 = ordered_pair(X3,X4) )
     => ( first(X1) = X3
        & second(X1) = X4 ) ),
    file('/export/starexec/sandbox/tmp/tmp.HDZ3KhkGwG/E---3.1_27242.p',unique_1st_and_2nd_in_pair_of_sets1) ).

fof(first_second,axiom,
    ! [X1,X2] :
      ( ( member(X1,universal_class)
        & member(X2,universal_class) )
     => ( first(ordered_pair(X1,X2)) = X1
        & second(ordered_pair(X1,X2)) = X2 ) ),
    file('/export/starexec/sandbox/tmp/tmp.HDZ3KhkGwG/E---3.1_27242.p',first_second) ).

fof(c_0_2,negated_conjecture,
    ~ ! [X3,X4,X1] :
        ( ( member(X3,universal_class)
          & member(X4,universal_class)
          & X1 = ordered_pair(X3,X4) )
       => ( first(X1) = X3
          & second(X1) = X4 ) ),
    inference(assume_negation,[status(cth)],[unique_1st_and_2nd_in_pair_of_sets1]) ).

fof(c_0_3,plain,
    ! [X13,X14] :
      ( ( first(ordered_pair(X13,X14)) = X13
        | ~ member(X13,universal_class)
        | ~ member(X14,universal_class) )
      & ( second(ordered_pair(X13,X14)) = X14
        | ~ member(X13,universal_class)
        | ~ member(X14,universal_class) ) ),
    inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[first_second])])]) ).

fof(c_0_4,negated_conjecture,
    ( member(esk1_0,universal_class)
    & member(esk2_0,universal_class)
    & esk3_0 = ordered_pair(esk1_0,esk2_0)
    & ( first(esk3_0) != esk1_0
      | second(esk3_0) != esk2_0 ) ),
    inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_2])])]) ).

cnf(c_0_5,plain,
    ( first(ordered_pair(X1,X2)) = X1
    | ~ member(X1,universal_class)
    | ~ member(X2,universal_class) ),
    inference(split_conjunct,[status(thm)],[c_0_3]) ).

cnf(c_0_6,negated_conjecture,
    member(esk2_0,universal_class),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

cnf(c_0_7,plain,
    ( second(ordered_pair(X1,X2)) = X2
    | ~ member(X1,universal_class)
    | ~ member(X2,universal_class) ),
    inference(split_conjunct,[status(thm)],[c_0_3]) ).

cnf(c_0_8,negated_conjecture,
    ( first(ordered_pair(X1,esk2_0)) = X1
    | ~ member(X1,universal_class) ),
    inference(spm,[status(thm)],[c_0_5,c_0_6]) ).

cnf(c_0_9,negated_conjecture,
    member(esk1_0,universal_class),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

cnf(c_0_10,negated_conjecture,
    esk3_0 = ordered_pair(esk1_0,esk2_0),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

cnf(c_0_11,negated_conjecture,
    ( second(ordered_pair(X1,esk2_0)) = esk2_0
    | ~ member(X1,universal_class) ),
    inference(spm,[status(thm)],[c_0_7,c_0_6]) ).

cnf(c_0_12,negated_conjecture,
    ( first(esk3_0) != esk1_0
    | second(esk3_0) != esk2_0 ),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

cnf(c_0_13,negated_conjecture,
    first(esk3_0) = esk1_0,
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_9]),c_0_10]) ).

cnf(c_0_14,negated_conjecture,
    second(esk3_0) = esk2_0,
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_9]),c_0_10]) ).

cnf(c_0_15,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_12,c_0_13])]),c_0_14])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13  % Problem    : SET020+1 : TPTP v8.1.2. Bugfixed v5.4.0.
% 0.07/0.14  % Command    : run_E %s %d THM
% 0.13/0.34  % Computer : n027.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit   : 2400
% 0.13/0.34  % WCLimit    : 300
% 0.13/0.34  % DateTime   : Mon Oct  2 17:59:30 EDT 2023
% 0.13/0.34  % CPUTime    : 
% 0.17/0.45  Running first-order theorem proving
% 0.17/0.45  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.HDZ3KhkGwG/E---3.1_27242.p
% 0.17/0.47  # Version: 3.1pre001
% 0.17/0.47  # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.17/0.47  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.47  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.17/0.47  # Starting new_bool_3 with 300s (1) cores
% 0.17/0.47  # Starting new_bool_1 with 300s (1) cores
% 0.17/0.47  # Starting sh5l with 300s (1) cores
% 0.17/0.47  # new_bool_1 with pid 27322 completed with status 0
% 0.17/0.47  # Result found by new_bool_1
% 0.17/0.47  # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.17/0.47  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.47  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.17/0.47  # Starting new_bool_3 with 300s (1) cores
% 0.17/0.47  # Starting new_bool_1 with 300s (1) cores
% 0.17/0.47  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.17/0.47  # Search class: FHHSF-FFSS21-SFFFFFNN
% 0.17/0.47  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.17/0.47  # Starting G-E--_110_C45_F1_PI_SE_CS_SP_PS_S4S with 181s (1) cores
% 0.17/0.47  # G-E--_110_C45_F1_PI_SE_CS_SP_PS_S4S with pid 27324 completed with status 0
% 0.17/0.47  # Result found by G-E--_110_C45_F1_PI_SE_CS_SP_PS_S4S
% 0.17/0.47  # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.17/0.47  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.47  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.17/0.47  # Starting new_bool_3 with 300s (1) cores
% 0.17/0.47  # Starting new_bool_1 with 300s (1) cores
% 0.17/0.47  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.17/0.47  # Search class: FHHSF-FFSS21-SFFFFFNN
% 0.17/0.47  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.17/0.47  # Starting G-E--_110_C45_F1_PI_SE_CS_SP_PS_S4S with 181s (1) cores
% 0.17/0.47  # Preprocessing time       : 0.001 s
% 0.17/0.47  # Presaturation interreduction done
% 0.17/0.47  
% 0.17/0.47  # Proof found!
% 0.17/0.47  # SZS status Theorem
% 0.17/0.47  # SZS output start CNFRefutation
% See solution above
% 0.17/0.47  # Parsed axioms                        : 44
% 0.17/0.47  # Removed by relevancy pruning/SinE    : 40
% 0.17/0.47  # Initial clauses                      : 10
% 0.17/0.47  # Removed in clause preprocessing      : 0
% 0.17/0.47  # Initial clauses in saturation        : 10
% 0.17/0.47  # Processed clauses                    : 26
% 0.17/0.47  # ...of these trivial                  : 0
% 0.17/0.47  # ...subsumed                          : 0
% 0.17/0.47  # ...remaining for further processing  : 25
% 0.17/0.47  # Other redundant clauses eliminated   : 0
% 0.17/0.47  # Clauses deleted for lack of memory   : 0
% 0.17/0.47  # Backward-subsumed                    : 0
% 0.17/0.47  # Backward-rewritten                   : 1
% 0.17/0.47  # Generated clauses                    : 12
% 0.17/0.47  # ...of the previous two non-redundant : 13
% 0.17/0.47  # ...aggressively subsumed             : 0
% 0.17/0.47  # Contextual simplify-reflections      : 0
% 0.17/0.47  # Paramodulations                      : 12
% 0.17/0.47  # Factorizations                       : 0
% 0.17/0.47  # NegExts                              : 0
% 0.17/0.47  # Equation resolutions                 : 0
% 0.17/0.47  # Total rewrite steps                  : 4
% 0.17/0.47  # Propositional unsat checks           : 0
% 0.17/0.47  #    Propositional check models        : 0
% 0.17/0.47  #    Propositional check unsatisfiable : 0
% 0.17/0.47  #    Propositional clauses             : 0
% 0.17/0.47  #    Propositional clauses after purity: 0
% 0.17/0.47  #    Propositional unsat core size     : 0
% 0.17/0.47  #    Propositional preprocessing time  : 0.000
% 0.17/0.47  #    Propositional encoding time       : 0.000
% 0.17/0.47  #    Propositional solver time         : 0.000
% 0.17/0.47  #    Success case prop preproc time    : 0.000
% 0.17/0.47  #    Success case prop encoding time   : 0.000
% 0.17/0.47  #    Success case prop solver time     : 0.000
% 0.17/0.47  # Current number of processed clauses  : 14
% 0.17/0.47  #    Positive orientable unit clauses  : 6
% 0.17/0.47  #    Positive unorientable unit clauses: 0
% 0.17/0.47  #    Negative unit clauses             : 0
% 0.17/0.47  #    Non-unit-clauses                  : 8
% 0.17/0.47  # Current number of unprocessed clauses: 7
% 0.17/0.47  # ...number of literals in the above   : 13
% 0.17/0.47  # Current number of archived formulas  : 0
% 0.17/0.47  # Current number of archived clauses   : 11
% 0.17/0.47  # Clause-clause subsumption calls (NU) : 4
% 0.17/0.47  # Rec. Clause-clause subsumption calls : 4
% 0.17/0.47  # Non-unit clause-clause subsumptions  : 0
% 0.17/0.47  # Unit Clause-clause subsumption calls : 0
% 0.17/0.47  # Rewrite failures with RHS unbound    : 0
% 0.17/0.47  # BW rewrite match attempts            : 1
% 0.17/0.47  # BW rewrite match successes           : 1
% 0.17/0.47  # Condensation attempts                : 0
% 0.17/0.47  # Condensation successes               : 0
% 0.17/0.47  # Termbank termtop insertions          : 1174
% 0.17/0.47  
% 0.17/0.47  # -------------------------------------------------
% 0.17/0.47  # User time                : 0.003 s
% 0.17/0.47  # System time              : 0.002 s
% 0.17/0.47  # Total time               : 0.004 s
% 0.17/0.47  # Maximum resident set size: 1860 pages
% 0.17/0.47  
% 0.17/0.47  # -------------------------------------------------
% 0.17/0.47  # User time                : 0.004 s
% 0.17/0.47  # System time              : 0.003 s
% 0.17/0.47  # Total time               : 0.007 s
% 0.17/0.47  # Maximum resident set size: 1724 pages
% 0.17/0.47  % E---3.1 exiting
% 0.17/0.47  % E---3.1 exiting
%------------------------------------------------------------------------------