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

View Problem - Process Solution

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

% Computer : n015.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 20:11:05 EDT 2023

% Result   : Timeout 6.35s 300.14s
% Output   : None 
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    6
% Syntax   : Number of formulae    :   19 (  11 unt;   0 def)
%            Number of atoms       :   33 (   0 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   27 (  13   ~;  10   |;   0   &)
%                                         (   0 <=>;   4  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   3 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    5 (   4 usr;   1 prp; 0-4 aty)
%            Number of functors    :    7 (   7 usr;   7 con; 0-0 aty)
%            Number of variables   :   20 (   0 sgn;  12   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(conj_2,hypothesis,
    ! [X9,X10] :
      ( v_Q(X9,X10)
     => ! [X11] :
          ( c_Natural_Oevaln(v_d,X10,v_n,X11)
         => v_R(X9,X11) ) ),
    file('/export/starexec/sandbox2/tmp/tmp.ploLvaT6GE/E---3.1_13061.p',conj_2) ).

fof(conj_6,conjecture,
    v_R(v_Z,v_s_H),
    file('/export/starexec/sandbox2/tmp/tmp.ploLvaT6GE/E---3.1_13061.p',conj_6) ).

fof(conj_5,hypothesis,
    c_Natural_Oevaln(v_d,v_s1,v_n,v_s_H),
    file('/export/starexec/sandbox2/tmp/tmp.ploLvaT6GE/E---3.1_13061.p',conj_5) ).

fof(conj_1,hypothesis,
    ! [X9,X10] :
      ( v_P(X9,X10)
     => ! [X11] :
          ( c_Natural_Oevaln(v_c,X10,v_n,X11)
         => v_Q(X9,X11) ) ),
    file('/export/starexec/sandbox2/tmp/tmp.ploLvaT6GE/E---3.1_13061.p',conj_1) ).

fof(conj_4,hypothesis,
    c_Natural_Oevaln(v_c,v_s,v_n,v_s1),
    file('/export/starexec/sandbox2/tmp/tmp.ploLvaT6GE/E---3.1_13061.p',conj_4) ).

fof(conj_3,hypothesis,
    v_P(v_Z,v_s),
    file('/export/starexec/sandbox2/tmp/tmp.ploLvaT6GE/E---3.1_13061.p',conj_3) ).

fof(c_0_6,hypothesis,
    ! [X334,X335,X336] :
      ( ~ v_Q(X334,X335)
      | ~ c_Natural_Oevaln(v_d,X335,v_n,X336)
      | v_R(X334,X336) ),
    inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[conj_2])])]) ).

fof(c_0_7,negated_conjecture,
    ~ v_R(v_Z,v_s_H),
    inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[conj_6])]) ).

cnf(c_0_8,hypothesis,
    ( v_R(X1,X3)
    | ~ v_Q(X1,X2)
    | ~ c_Natural_Oevaln(v_d,X2,v_n,X3) ),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

cnf(c_0_9,hypothesis,
    c_Natural_Oevaln(v_d,v_s1,v_n,v_s_H),
    inference(split_conjunct,[status(thm)],[conj_5]) ).

fof(c_0_10,hypothesis,
    ! [X331,X332,X333] :
      ( ~ v_P(X331,X332)
      | ~ c_Natural_Oevaln(v_c,X332,v_n,X333)
      | v_Q(X331,X333) ),
    inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[conj_1])])]) ).

cnf(c_0_11,negated_conjecture,
    ~ v_R(v_Z,v_s_H),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

cnf(c_0_12,hypothesis,
    ( v_R(X1,v_s_H)
    | ~ v_Q(X1,v_s1) ),
    inference(spm,[status(thm)],[c_0_8,c_0_9]) ).

cnf(c_0_13,hypothesis,
    ( v_Q(X1,X3)
    | ~ v_P(X1,X2)
    | ~ c_Natural_Oevaln(v_c,X2,v_n,X3) ),
    inference(split_conjunct,[status(thm)],[c_0_10]) ).

cnf(c_0_14,hypothesis,
    c_Natural_Oevaln(v_c,v_s,v_n,v_s1),
    inference(split_conjunct,[status(thm)],[conj_4]) ).

cnf(c_0_15,negated_conjecture,
    ~ v_Q(v_Z,v_s1),
    inference(spm,[status(thm)],[c_0_11,c_0_12]) ).

cnf(c_0_16,hypothesis,
    ( v_Q(X1,v_s1)
    | ~ v_P(X1,v_s) ),
    inference(spm,[status(thm)],[c_0_13,c_0_14]) ).

cnf(c_0_17,hypothesis,
    v_P(v_Z,v_s),
    inference(split_conjunct,[status(thm)],[conj_3]) ).

cnf(c_0_18,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.10  % Problem    : SWW345+1 : TPTP v8.1.2. Released v5.2.0.
% 0.05/0.11  % Command    : run_E %s %d THM
% 0.10/0.32  % Computer : n015.cluster.edu
% 0.10/0.32  % Model    : x86_64 x86_64
% 0.10/0.32  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.32  % Memory   : 8042.1875MB
% 0.10/0.32  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.10/0.32  % CPULimit   : 2400
% 0.10/0.32  % WCLimit    : 300
% 0.10/0.32  % DateTime   : Mon Oct  2 22:58:31 EDT 2023
% 0.10/0.32  % CPUTime    : 
% 1.28/1.53  Running first-order model finding
% 1.28/1.53  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.ploLvaT6GE/E---3.1_13061.p
% 6.35/300.14  # Version: 3.1pre001
% 6.35/300.14  # Preprocessing class: FMLMSMSMSSSNFFN.
% 6.35/300.14  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 6.35/300.14  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 6.35/300.14  # Starting new_bool_3 with 300s (1) cores
% 6.35/300.14  # Starting new_bool_1 with 300s (1) cores
% 6.35/300.14  # Starting sh5l with 300s (1) cores
% 6.35/300.14  # new_bool_3 with pid 13173 completed with status 0
% 6.35/300.14  # Result found by new_bool_3
% 6.35/300.14  # Preprocessing class: FMLMSMSMSSSNFFN.
% 6.35/300.14  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 6.35/300.14  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 6.35/300.14  # Starting new_bool_3 with 300s (1) cores
% 6.35/300.14  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 6.35/300.14  # Search class: FGHSM-SSLM32-DFFFFFNN
% 6.35/300.14  # Scheduled 13 strats onto 1 cores with 300 seconds (300 total)
% 6.35/300.14  # Starting G-E--_208_C18_F1_SE_CS_SP_PI_PS_S5PRR_RG_S04AN with 23s (1) cores
% 6.35/300.14  # G-E--_208_C18_F1_SE_CS_SP_PI_PS_S5PRR_RG_S04AN with pid 13177 completed with status 0
% 6.35/300.14  # Result found by G-E--_208_C18_F1_SE_CS_SP_PI_PS_S5PRR_RG_S04AN
% 6.35/300.14  # Preprocessing class: FMLMSMSMSSSNFFN.
% 6.35/300.14  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 6.35/300.14  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 6.35/300.14  # Starting new_bool_3 with 300s (1) cores
% 6.35/300.14  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 6.35/300.14  # Search class: FGHSM-SSLM32-DFFFFFNN
% 6.35/300.14  # Scheduled 13 strats onto 1 cores with 300 seconds (300 total)
% 6.35/300.14  # Starting G-E--_208_C18_F1_SE_CS_SP_PI_PS_S5PRR_RG_S04AN with 23s (1) cores
% 6.35/300.14  # Preprocessing time       : 0.021 s
% 6.35/300.14  # Presaturation interreduction done
% 6.35/300.14  
% 6.35/300.14  # Proof found!
% 6.35/300.14  # SZS status Theorem
% 6.35/300.14  # SZS output start CNFRefutation
% See solution above
% 6.35/300.14  # Parsed axioms                        : 5211
% 6.35/300.14  # Removed by relevancy pruning/SinE    : 4451
% 6.35/300.14  # Initial clauses                      : 1144
% 6.35/300.14  # Removed in clause preprocessing      : 56
% 6.35/300.14  # Initial clauses in saturation        : 1088
% 6.35/300.14  # Processed clauses                    : 1894
% 6.35/300.14  # ...of these trivial                  : 35
% 6.35/300.14  # ...subsumed                          : 263
% 6.35/300.14  # ...remaining for further processing  : 1596
% 6.35/300.14  # Other redundant clauses eliminated   : 295
% 6.35/300.14  # Clauses deleted for lack of memory   : 0
% 6.35/300.14  # Backward-subsumed                    : 6
% 6.35/300.14  # Backward-rewritten                   : 21
% 6.35/300.14  # Generated clauses                    : 15753
% 6.35/300.14  # ...of the previous two non-redundant : 14022
% 6.35/300.14  # ...aggressively subsumed             : 0
% 6.35/300.14  # Contextual simplify-reflections      : 5
% 6.35/300.14  # Paramodulations                      : 15417
% 6.35/300.14  # Factorizations                       : 8
% 6.35/300.14  # NegExts                              : 0
% 6.35/300.14  # Equation resolutions                 : 339
% 6.35/300.14  # Total rewrite steps                  : 5330
% 6.35/300.14  # Propositional unsat checks           : 0
% 6.35/300.14  #    Propositional check models        : 0
% 6.35/300.14  #    Propositional check unsatisfiable : 0
% 6.35/300.14  #    Propositional clauses             : 0
% 6.35/300.14  #    Propositional clauses after purity: 0
% 6.35/300.14  #    Propositional unsat core size     : 0
% 6.35/300.14  #    Propositional preprocessing time  : 0.000
% 6.35/300.14  #    Propositional encoding time       : 0.000
% 6.35/300.14  #    Propositional solver time         : 0.000
% 6.35/300.14  #    Success case prop preproc time    : 0.000
% 6.35/300.14  #    Success case prop encoding time   : 0.000
% 6.35/300.14  #    Success case prop solver time     : 0.000
% 6.35/300.14  # Current number of processed clauses  : 746
% 6.35/300.14  #    Positive orientable unit clauses  : 156
% 6.35/300.14  #    Positive unorientable unit clauses: 21
% 6.35/300.14  #    Negative unit clauses             : 49
% 6.35/300.14  #    Non-unit-clauses                  : 520
% 6.35/300.14  # Current number of unprocessed clauses: 13959
% 6.35/300.14  # ...number of literals in the above   : 37819
% 6.35/300.14  # Current number of archived formulas  : 0
% 6.35/300.14  # Current number of archived clauses   : 770
% 6.35/300.14  # Clause-clause subsumption calls (NU) : 112314
% 6.35/300.14  # Rec. Clause-clause subsumption calls : 90459
% 6.35/300.14  # Non-unit clause-clause subsumptions  : 202
% 6.35/300.14  # Unit Clause-clause subsumption calls : 2739
% 6.35/300.14  # Rewrite failures with RHS unbound    : 0
% 6.35/300.14  # BW rewrite match attempts            : 3502
% 6.35/300.14  # BW rewrite match successes           : 184
% 6.35/300.14  # Condensation attempts                : 0
% 6.35/300.14  # Condensation successes               : 0
% 6.35/300.14  # Termbank termtop insertions          : 760730
% 6.35/300.14  
% 6.35/300.14  # -------------------------------------------------
% 6.35/300.14  # User time                : 0.640 s
% 6.35/300.14  # System time              : 0.026 s
% 6.35/300.14  # Total time               : 0.666 s
% 6.35/300.14  # Maximum resident set size: 11820 pages
% 6.35/300.14  
% 6.35/300.14  # -------------------------------------------------
% 6.35/300.14  # User time                : 0.877 s
% 6.35/300.14  # System time              : 0.043 s
% 6.35/300.14  # Total time               : 0.920 s
% 6.35/300.14  # Maximum resident set size: 9540 pages
% 6.35/300.14  % E---3.1 exiting
%------------------------------------------------------------------------------