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

View Problem - Process Solution

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

% Computer : n008.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:37:26 EDT 2023

% Result   : Theorem 0.65s 0.62s
% Output   : CNFRefutation 0.65s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :    2
% Syntax   : Number of formulae    :    9 (   3 unt;   0 def)
%            Number of atoms       :   15 (   0 equ)
%            Maximal formula atoms :    2 (   1 avg)
%            Number of connectives :   11 (   5   ~;   2   |;   4   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    5 (   3 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    2 (   1 usr;   1 prp; 0-3 aty)
%            Number of functors    :    4 (   4 usr;   4 con; 0-0 aty)
%            Number of variables   :    9 (   0 sgn;   2   !;   5   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(testcase_conclusion_fullish_002_Existential_Blank_Nodes,conjecture,
    ? [X42,X43] :
      ( iext(uri_ex_p,X42,X43)
      & iext(uri_ex_q,X43,X42) ),
    file('/export/starexec/sandbox2/tmp/tmp.3GjWJV9ip1/E---3.1_30585.p',testcase_conclusion_fullish_002_Existential_Blank_Nodes) ).

fof(testcase_premise_fullish_002_Existential_Blank_Nodes,axiom,
    ? [X44] :
      ( iext(uri_ex_p,uri_ex_s,X44)
      & iext(uri_ex_q,X44,uri_ex_s) ),
    file('/export/starexec/sandbox2/tmp/tmp.3GjWJV9ip1/E---3.1_30585.p',testcase_premise_fullish_002_Existential_Blank_Nodes) ).

fof(c_0_2,negated_conjecture,
    ~ ? [X42,X43] :
        ( iext(uri_ex_p,X42,X43)
        & iext(uri_ex_q,X43,X42) ),
    inference(assume_negation,[status(cth)],[testcase_conclusion_fullish_002_Existential_Blank_Nodes]) ).

fof(c_0_3,negated_conjecture,
    ! [X1251,X1252] :
      ( ~ iext(uri_ex_p,X1251,X1252)
      | ~ iext(uri_ex_q,X1252,X1251) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_2])]) ).

fof(c_0_4,plain,
    ( iext(uri_ex_p,uri_ex_s,esk192_0)
    & iext(uri_ex_q,esk192_0,uri_ex_s) ),
    inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[testcase_premise_fullish_002_Existential_Blank_Nodes])]) ).

cnf(c_0_5,negated_conjecture,
    ( ~ iext(uri_ex_p,X1,X2)
    | ~ iext(uri_ex_q,X2,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_3]) ).

cnf(c_0_6,plain,
    iext(uri_ex_p,uri_ex_s,esk192_0),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

cnf(c_0_7,plain,
    iext(uri_ex_q,esk192_0,uri_ex_s),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11  % Problem    : SWB002+1 : TPTP v8.1.2. Released v5.2.0.
% 0.03/0.13  % Command    : run_E %s %d THM
% 0.13/0.33  % Computer : n008.cluster.edu
% 0.13/0.33  % Model    : x86_64 x86_64
% 0.13/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33  % Memory   : 8042.1875MB
% 0.13/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33  % CPULimit   : 2400
% 0.13/0.33  % WCLimit    : 300
% 0.13/0.33  % DateTime   : Mon Oct  2 20:22:28 EDT 2023
% 0.13/0.34  % CPUTime    : 
% 0.20/0.50  Running first-order model finding
% 0.20/0.50  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.3GjWJV9ip1/E---3.1_30585.p
% 0.65/0.62  # Version: 3.1pre001
% 0.65/0.62  # Preprocessing class: FSLMSMSLSSSNFFN.
% 0.65/0.62  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.65/0.62  # Starting G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with 900s (3) cores
% 0.65/0.62  # Starting new_bool_3 with 600s (2) cores
% 0.65/0.62  # Starting new_bool_1 with 600s (2) cores
% 0.65/0.62  # Starting sh5l with 300s (1) cores
% 0.65/0.62  # G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with pid 30662 completed with status 0
% 0.65/0.62  # Result found by G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI
% 0.65/0.62  # Preprocessing class: FSLMSMSLSSSNFFN.
% 0.65/0.62  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.65/0.62  # Starting G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with 900s (3) cores
% 0.65/0.62  # No SInE strategy applied
% 0.65/0.62  # Search class: FGHSM-SMLM33-SFFFFFNN
% 0.65/0.62  # partial match(1): FGHSM-SMLM33-DFFFFFNN
% 0.65/0.62  # Scheduled 6 strats onto 3 cores with 900 seconds (900 total)
% 0.65/0.62  # Starting SAT001_MinMin_p005000_rr with 487s (1) cores
% 0.65/0.62  # Starting G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with 91s (1) cores
% 0.65/0.62  # Starting SAT001_CA_MinMin_p005000_rr with 82s (1) cores
% 0.65/0.62  # G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with pid 30676 completed with status 0
% 0.65/0.62  # Result found by G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI
% 0.65/0.62  # Preprocessing class: FSLMSMSLSSSNFFN.
% 0.65/0.62  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.65/0.62  # Starting G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with 900s (3) cores
% 0.65/0.62  # No SInE strategy applied
% 0.65/0.62  # Search class: FGHSM-SMLM33-SFFFFFNN
% 0.65/0.62  # partial match(1): FGHSM-SMLM33-DFFFFFNN
% 0.65/0.62  # Scheduled 6 strats onto 3 cores with 900 seconds (900 total)
% 0.65/0.62  # Starting SAT001_MinMin_p005000_rr with 487s (1) cores
% 0.65/0.62  # Starting G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with 91s (1) cores
% 0.65/0.62  # Preprocessing time       : 0.017 s
% 0.65/0.62  
% 0.65/0.62  # Proof found!
% 0.65/0.62  # SZS status Theorem
% 0.65/0.62  # SZS output start CNFRefutation
% See solution above
% 0.65/0.62  # Parsed axioms                        : 560
% 0.65/0.62  # Removed by relevancy pruning/SinE    : 0
% 0.65/0.62  # Initial clauses                      : 1269
% 0.65/0.62  # Removed in clause preprocessing      : 111
% 0.65/0.62  # Initial clauses in saturation        : 1158
% 0.65/0.62  # Processed clauses                    : 137
% 0.65/0.62  # ...of these trivial                  : 0
% 0.65/0.62  # ...subsumed                          : 0
% 0.65/0.62  # ...remaining for further processing  : 137
% 0.65/0.62  # Other redundant clauses eliminated   : 0
% 0.65/0.62  # Clauses deleted for lack of memory   : 0
% 0.65/0.62  # Backward-subsumed                    : 0
% 0.65/0.62  # Backward-rewritten                   : 0
% 0.65/0.62  # Generated clauses                    : 1
% 0.65/0.62  # ...of the previous two non-redundant : 0
% 0.65/0.62  # ...aggressively subsumed             : 0
% 0.65/0.62  # Contextual simplify-reflections      : 0
% 0.65/0.62  # Paramodulations                      : 1
% 0.65/0.62  # Factorizations                       : 0
% 0.65/0.62  # NegExts                              : 0
% 0.65/0.62  # Equation resolutions                 : 0
% 0.65/0.62  # Total rewrite steps                  : 1
% 0.65/0.62  # Propositional unsat checks           : 0
% 0.65/0.62  #    Propositional check models        : 0
% 0.65/0.62  #    Propositional check unsatisfiable : 0
% 0.65/0.62  #    Propositional clauses             : 0
% 0.65/0.62  #    Propositional clauses after purity: 0
% 0.65/0.62  #    Propositional unsat core size     : 0
% 0.65/0.62  #    Propositional preprocessing time  : 0.000
% 0.65/0.62  #    Propositional encoding time       : 0.000
% 0.65/0.62  #    Propositional solver time         : 0.000
% 0.65/0.62  #    Success case prop preproc time    : 0.000
% 0.65/0.62  #    Success case prop encoding time   : 0.000
% 0.65/0.62  #    Success case prop solver time     : 0.000
% 0.65/0.62  # Current number of processed clauses  : 137
% 0.65/0.62  #    Positive orientable unit clauses  : 133
% 0.65/0.62  #    Positive unorientable unit clauses: 0
% 0.65/0.62  #    Negative unit clauses             : 3
% 0.65/0.62  #    Non-unit-clauses                  : 1
% 0.65/0.62  # Current number of unprocessed clauses: 1021
% 0.65/0.62  # ...number of literals in the above   : 5055
% 0.65/0.62  # Current number of archived formulas  : 0
% 0.65/0.62  # Current number of archived clauses   : 1
% 0.65/0.62  # Clause-clause subsumption calls (NU) : 0
% 0.65/0.62  # Rec. Clause-clause subsumption calls : 0
% 0.65/0.62  # Non-unit clause-clause subsumptions  : 0
% 0.65/0.62  # Unit Clause-clause subsumption calls : 0
% 0.65/0.62  # Rewrite failures with RHS unbound    : 0
% 0.65/0.62  # BW rewrite match attempts            : 0
% 0.65/0.62  # BW rewrite match successes           : 0
% 0.65/0.62  # Condensation attempts                : 0
% 0.65/0.62  # Condensation successes               : 0
% 0.65/0.62  # Termbank termtop insertions          : 78842
% 0.65/0.62  
% 0.65/0.62  # -------------------------------------------------
% 0.65/0.62  # User time                : 0.073 s
% 0.65/0.62  # System time              : 0.010 s
% 0.65/0.62  # Total time               : 0.083 s
% 0.65/0.62  # Maximum resident set size: 5736 pages
% 0.65/0.62  
% 0.65/0.62  # -------------------------------------------------
% 0.65/0.62  # User time                : 0.123 s
% 0.65/0.62  # System time              : 0.023 s
% 0.65/0.62  # Total time               : 0.146 s
% 0.65/0.62  # Maximum resident set size: 2232 pages
% 0.65/0.62  % E---3.1 exiting
%------------------------------------------------------------------------------