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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E---3.1
% Problem  : SET954+1 : TPTP v8.1.2. Released v3.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E %s %d THM

% Computer : n016.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:21:24 EDT 2023

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

% Comments : 
%------------------------------------------------------------------------------
fof(t107_zfmisc_1,conjecture,
    ! [X1,X2,X3,X4] :
      ( in(ordered_pair(X1,X2),cartesian_product2(X3,X4))
     => in(ordered_pair(X2,X1),cartesian_product2(X4,X3)) ),
    file('/export/starexec/sandbox/tmp/tmp.11X8eSOguN/E---3.1_11755.p',t107_zfmisc_1) ).

fof(l55_zfmisc_1,axiom,
    ! [X1,X2,X3,X4] :
      ( in(ordered_pair(X1,X2),cartesian_product2(X3,X4))
    <=> ( in(X1,X3)
        & in(X2,X4) ) ),
    file('/export/starexec/sandbox/tmp/tmp.11X8eSOguN/E---3.1_11755.p',l55_zfmisc_1) ).

fof(c_0_2,negated_conjecture,
    ~ ! [X1,X2,X3,X4] :
        ( in(ordered_pair(X1,X2),cartesian_product2(X3,X4))
       => in(ordered_pair(X2,X1),cartesian_product2(X4,X3)) ),
    inference(assume_negation,[status(cth)],[t107_zfmisc_1]) ).

fof(c_0_3,plain,
    ! [X11,X12,X13,X14] :
      ( ( in(X11,X13)
        | ~ in(ordered_pair(X11,X12),cartesian_product2(X13,X14)) )
      & ( in(X12,X14)
        | ~ in(ordered_pair(X11,X12),cartesian_product2(X13,X14)) )
      & ( ~ in(X11,X13)
        | ~ in(X12,X14)
        | in(ordered_pair(X11,X12),cartesian_product2(X13,X14)) ) ),
    inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[l55_zfmisc_1])])]) ).

fof(c_0_4,negated_conjecture,
    ( in(ordered_pair(esk1_0,esk2_0),cartesian_product2(esk3_0,esk4_0))
    & ~ in(ordered_pair(esk2_0,esk1_0),cartesian_product2(esk4_0,esk3_0)) ),
    inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_2])])]) ).

cnf(c_0_5,plain,
    ( in(X1,X2)
    | ~ in(ordered_pair(X3,X1),cartesian_product2(X4,X2)) ),
    inference(split_conjunct,[status(thm)],[c_0_3]) ).

cnf(c_0_6,negated_conjecture,
    in(ordered_pair(esk1_0,esk2_0),cartesian_product2(esk3_0,esk4_0)),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

cnf(c_0_7,negated_conjecture,
    ~ in(ordered_pair(esk2_0,esk1_0),cartesian_product2(esk4_0,esk3_0)),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

cnf(c_0_8,plain,
    ( in(ordered_pair(X1,X3),cartesian_product2(X2,X4))
    | ~ in(X1,X2)
    | ~ in(X3,X4) ),
    inference(split_conjunct,[status(thm)],[c_0_3]) ).

cnf(c_0_9,negated_conjecture,
    in(esk2_0,esk4_0),
    inference(spm,[status(thm)],[c_0_5,c_0_6]) ).

cnf(c_0_10,plain,
    ( in(X1,X2)
    | ~ in(ordered_pair(X1,X3),cartesian_product2(X2,X4)) ),
    inference(split_conjunct,[status(thm)],[c_0_3]) ).

cnf(c_0_11,negated_conjecture,
    ~ in(esk1_0,esk3_0),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_8]),c_0_9])]) ).

cnf(c_0_12,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_6]),c_0_11]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.13  % Problem    : SET954+1 : TPTP v8.1.2. Released v3.2.0.
% 0.11/0.14  % Command    : run_E %s %d THM
% 0.14/0.35  % Computer : n016.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 16:54:36 EDT 2023
% 0.14/0.35  % CPUTime    : 
% 0.21/0.49  Running first-order theorem proving
% 0.21/0.49  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.11X8eSOguN/E---3.1_11755.p
% 0.21/0.50  # Version: 3.1pre001
% 0.21/0.50  # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.21/0.50  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.50  # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.21/0.50  # Starting new_bool_3 with 300s (1) cores
% 0.21/0.50  # Starting new_bool_1 with 300s (1) cores
% 0.21/0.50  # Starting sh5l with 300s (1) cores
% 0.21/0.50  # new_bool_3 with pid 11834 completed with status 0
% 0.21/0.50  # Result found by new_bool_3
% 0.21/0.50  # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.21/0.50  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.50  # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.21/0.50  # Starting new_bool_3 with 300s (1) cores
% 0.21/0.50  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/0.50  # Search class: FHHNF-FFSF22-SFFFFFNN
% 0.21/0.50  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.50  # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.21/0.50  # SAT001_MinMin_p005000_rr_RG with pid 11838 completed with status 0
% 0.21/0.50  # Result found by SAT001_MinMin_p005000_rr_RG
% 0.21/0.50  # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.21/0.50  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.50  # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.21/0.50  # Starting new_bool_3 with 300s (1) cores
% 0.21/0.50  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/0.50  # Search class: FHHNF-FFSF22-SFFFFFNN
% 0.21/0.50  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.50  # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.21/0.50  # Preprocessing time       : 0.001 s
% 0.21/0.50  # Presaturation interreduction done
% 0.21/0.50  
% 0.21/0.50  # Proof found!
% 0.21/0.50  # SZS status Theorem
% 0.21/0.50  # SZS output start CNFRefutation
% See solution above
% 0.21/0.50  # Parsed axioms                        : 8
% 0.21/0.50  # Removed by relevancy pruning/SinE    : 2
% 0.21/0.50  # Initial clauses                      : 9
% 0.21/0.50  # Removed in clause preprocessing      : 0
% 0.21/0.50  # Initial clauses in saturation        : 9
% 0.21/0.50  # Processed clauses                    : 24
% 0.21/0.50  # ...of these trivial                  : 0
% 0.21/0.50  # ...subsumed                          : 0
% 0.21/0.50  # ...remaining for further processing  : 23
% 0.21/0.50  # Other redundant clauses eliminated   : 0
% 0.21/0.50  # Clauses deleted for lack of memory   : 0
% 0.21/0.50  # Backward-subsumed                    : 0
% 0.21/0.50  # Backward-rewritten                   : 0
% 0.21/0.50  # Generated clauses                    : 8
% 0.21/0.50  # ...of the previous two non-redundant : 6
% 0.21/0.50  # ...aggressively subsumed             : 0
% 0.21/0.50  # Contextual simplify-reflections      : 0
% 0.21/0.50  # Paramodulations                      : 8
% 0.21/0.50  # Factorizations                       : 0
% 0.21/0.50  # NegExts                              : 0
% 0.21/0.50  # Equation resolutions                 : 0
% 0.21/0.50  # Total rewrite steps                  : 1
% 0.21/0.50  # Propositional unsat checks           : 0
% 0.21/0.50  #    Propositional check models        : 0
% 0.21/0.50  #    Propositional check unsatisfiable : 0
% 0.21/0.50  #    Propositional clauses             : 0
% 0.21/0.50  #    Propositional clauses after purity: 0
% 0.21/0.50  #    Propositional unsat core size     : 0
% 0.21/0.50  #    Propositional preprocessing time  : 0.000
% 0.21/0.50  #    Propositional encoding time       : 0.000
% 0.21/0.50  #    Propositional solver time         : 0.000
% 0.21/0.50  #    Success case prop preproc time    : 0.000
% 0.21/0.50  #    Success case prop encoding time   : 0.000
% 0.21/0.50  #    Success case prop solver time     : 0.000
% 0.21/0.50  # Current number of processed clauses  : 14
% 0.21/0.50  #    Positive orientable unit clauses  : 3
% 0.21/0.50  #    Positive unorientable unit clauses: 0
% 0.21/0.50  #    Negative unit clauses             : 6
% 0.21/0.50  #    Non-unit-clauses                  : 5
% 0.21/0.50  # Current number of unprocessed clauses: 0
% 0.21/0.50  # ...number of literals in the above   : 0
% 0.21/0.50  # Current number of archived formulas  : 0
% 0.21/0.50  # Current number of archived clauses   : 9
% 0.21/0.50  # Clause-clause subsumption calls (NU) : 21
% 0.21/0.50  # Rec. Clause-clause subsumption calls : 21
% 0.21/0.50  # Non-unit clause-clause subsumptions  : 0
% 0.21/0.50  # Unit Clause-clause subsumption calls : 12
% 0.21/0.50  # Rewrite failures with RHS unbound    : 0
% 0.21/0.50  # BW rewrite match attempts            : 0
% 0.21/0.50  # BW rewrite match successes           : 0
% 0.21/0.50  # Condensation attempts                : 0
% 0.21/0.50  # Condensation successes               : 0
% 0.21/0.50  # Termbank termtop insertions          : 550
% 0.21/0.50  
% 0.21/0.50  # -------------------------------------------------
% 0.21/0.50  # User time                : 0.004 s
% 0.21/0.50  # System time              : 0.002 s
% 0.21/0.50  # Total time               : 0.006 s
% 0.21/0.50  # Maximum resident set size: 1752 pages
% 0.21/0.50  
% 0.21/0.50  # -------------------------------------------------
% 0.21/0.50  # User time                : 0.004 s
% 0.21/0.50  # System time              : 0.005 s
% 0.21/0.50  # Total time               : 0.009 s
% 0.21/0.50  # Maximum resident set size: 1676 pages
% 0.21/0.50  % E---3.1 exiting
% 0.21/0.50  % E---3.1 exiting
%------------------------------------------------------------------------------