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

View Problem - Process Solution

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

% Computer : n031.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:43:27 EDT 2023

% Result   : Theorem 0.15s 0.42s
% Output   : CNFRefutation 0.15s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :    3
% Syntax   : Number of formulae    :    8 (   4 unt;   0 def)
%            Number of atoms       :   60 (  14 equ)
%            Maximal formula atoms :   26 (   7 avg)
%            Number of connectives :   55 (   3   ~;   0   |;  35   &)
%                                         (   1 <=>;  16  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   14 (   5 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    5 (   3 usr;   3 prp; 0-2 aty)
%            Number of functors    :   17 (  17 usr;  14 con; 0-3 aty)
%            Number of variables   :   18 (   0 sgn;  18   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(quaternion_ds1_inuse_0018,conjecture,
    ( ( ! [X14] :
          ( ( leq(n0,X14)
            & leq(X14,minus(m_measvars,n1)) )
         => a_select2(rho_defuse,X14) = use )
      & ! [X18] :
          ( ( leq(n0,X18)
            & leq(X18,minus(n_statevars,n1)) )
         => a_select2(sigma_defuse,X18) = use )
      & ! [X4,X20] :
          ( ( leq(n0,X4)
            & leq(n0,X20)
            & leq(X4,n2)
            & leq(X20,minus(n_steps,n1)) )
         => a_select3(u_defuse,X4,X20) = use )
      & ! [X21] :
          ( ( leq(n0,X21)
            & leq(X21,minus(n_statevars,n1)) )
         => a_select2(xinit_defuse,X21) = use )
      & ! [X22] :
          ( ( leq(n0,X22)
            & leq(X22,minus(n_statevars,n1)) )
         => a_select2(xinit_mean_defuse,X22) = use )
      & ! [X28] :
          ( ( leq(n0,X28)
            & leq(X28,minus(n_statevars,n1)) )
         => a_select2(xinit_noise_defuse,X28) = use )
      & ! [X29,X5] :
          ( ( leq(n0,X29)
            & leq(n0,X5)
            & leq(X29,minus(m_measvars,n1))
            & leq(X5,minus(n_steps,n1)) )
         => a_select3(z_defuse,X29,X5) = use ) )
   => true ),
    file('/export/starexec/sandbox/tmp/tmp.ty3HfAIdXm/E---3.1_26857.p',quaternion_ds1_inuse_0018) ).

fof(ttrue,axiom,
    true,
    file('/export/starexec/sandbox/tmp/tmp.ty3HfAIdXm/E---3.1_26857.p',ttrue) ).

fof(c_0_2,plain,
    ( epred1_0
  <=> ( ! [X14] :
          ( ( leq(n0,X14)
            & leq(X14,minus(m_measvars,n1)) )
         => a_select2(rho_defuse,X14) = use )
      & ! [X18] :
          ( ( leq(n0,X18)
            & leq(X18,minus(n_statevars,n1)) )
         => a_select2(sigma_defuse,X18) = use )
      & ! [X4,X20] :
          ( ( leq(n0,X4)
            & leq(n0,X20)
            & leq(X4,n2)
            & leq(X20,minus(n_steps,n1)) )
         => a_select3(u_defuse,X4,X20) = use )
      & ! [X21] :
          ( ( leq(n0,X21)
            & leq(X21,minus(n_statevars,n1)) )
         => a_select2(xinit_defuse,X21) = use )
      & ! [X22] :
          ( ( leq(n0,X22)
            & leq(X22,minus(n_statevars,n1)) )
         => a_select2(xinit_mean_defuse,X22) = use )
      & ! [X28] :
          ( ( leq(n0,X28)
            & leq(X28,minus(n_statevars,n1)) )
         => a_select2(xinit_noise_defuse,X28) = use )
      & ! [X29,X5] :
          ( ( leq(n0,X29)
            & leq(n0,X5)
            & leq(X29,minus(m_measvars,n1))
            & leq(X5,minus(n_steps,n1)) )
         => a_select3(z_defuse,X29,X5) = use ) ) ),
    introduced(definition) ).

fof(c_0_3,negated_conjecture,
    ~ ( epred1_0
     => true ),
    inference(apply_def,[status(thm)],[inference(assume_negation,[status(cth)],[quaternion_ds1_inuse_0018]),c_0_2]) ).

fof(c_0_4,negated_conjecture,
    ( epred1_0
    & ~ true ),
    inference(fof_nnf,[status(thm)],[c_0_3]) ).

cnf(c_0_5,negated_conjecture,
    ~ true,
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

cnf(c_0_6,plain,
    true,
    inference(split_conjunct,[status(thm)],[ttrue]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10  % Problem    : SWV106+1 : TPTP v8.1.2. Bugfixed v3.3.0.
% 0.10/0.10  % Command    : run_E %s %d THM
% 0.10/0.30  % Computer : n031.cluster.edu
% 0.10/0.30  % Model    : x86_64 x86_64
% 0.10/0.30  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.30  % Memory   : 8042.1875MB
% 0.10/0.30  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.10/0.30  % CPULimit   : 2400
% 0.10/0.30  % WCLimit    : 300
% 0.10/0.30  % DateTime   : Tue Oct  3 03:48:58 EDT 2023
% 0.10/0.30  % CPUTime    : 
% 0.15/0.41  Running first-order theorem proving
% 0.15/0.41  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.ty3HfAIdXm/E---3.1_26857.p
% 0.15/0.42  # Version: 3.1pre001
% 0.15/0.42  # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.15/0.42  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.42  # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.15/0.42  # Starting new_bool_3 with 300s (1) cores
% 0.15/0.42  # Starting new_bool_1 with 300s (1) cores
% 0.15/0.42  # Starting sh5l with 300s (1) cores
% 0.15/0.42  # new_bool_1 with pid 26937 completed with status 0
% 0.15/0.42  # Result found by new_bool_1
% 0.15/0.42  # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.15/0.42  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.42  # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.15/0.42  # Starting new_bool_3 with 300s (1) cores
% 0.15/0.42  # Starting new_bool_1 with 300s (1) cores
% 0.15/0.42  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/0.42  # Search class: FGUSM-FFMM31-MFFFFFNN
% 0.15/0.42  # partial match(1): FGHSM-FFMM31-MFFFFFNN
% 0.15/0.42  # Scheduled 13 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.42  # Starting G-E--_107_C41_F1_PI_AE_CS_SP_PS_S4S with 23s (1) cores
% 0.15/0.42  # G-E--_107_C41_F1_PI_AE_CS_SP_PS_S4S with pid 26939 completed with status 0
% 0.15/0.42  # Result found by G-E--_107_C41_F1_PI_AE_CS_SP_PS_S4S
% 0.15/0.42  # Preprocessing class: FSLSSMSMSSSNFFN.
% 0.15/0.42  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.42  # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.15/0.42  # Starting new_bool_3 with 300s (1) cores
% 0.15/0.42  # Starting new_bool_1 with 300s (1) cores
% 0.15/0.42  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/0.42  # Search class: FGUSM-FFMM31-MFFFFFNN
% 0.15/0.42  # partial match(1): FGHSM-FFMM31-MFFFFFNN
% 0.15/0.42  # Scheduled 13 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.42  # Starting G-E--_107_C41_F1_PI_AE_CS_SP_PS_S4S with 23s (1) cores
% 0.15/0.42  # Preprocessing time       : 0.002 s
% 0.15/0.42  # Presaturation interreduction done
% 0.15/0.42  
% 0.15/0.42  # Proof found!
% 0.15/0.42  # SZS status Theorem
% 0.15/0.42  # SZS output start CNFRefutation
% See solution above
% 0.15/0.42  # Parsed axioms                        : 85
% 0.15/0.42  # Removed by relevancy pruning/SinE    : 23
% 0.15/0.42  # Initial clauses                      : 73
% 0.15/0.42  # Removed in clause preprocessing      : 0
% 0.15/0.42  # Initial clauses in saturation        : 73
% 0.15/0.42  # Processed clauses                    : 3
% 0.15/0.42  # ...of these trivial                  : 0
% 0.15/0.42  # ...subsumed                          : 0
% 0.15/0.42  # ...remaining for further processing  : 2
% 0.15/0.42  # Other redundant clauses eliminated   : 0
% 0.15/0.42  # Clauses deleted for lack of memory   : 0
% 0.15/0.42  # Backward-subsumed                    : 0
% 0.15/0.42  # Backward-rewritten                   : 0
% 0.15/0.42  # Generated clauses                    : 0
% 0.15/0.42  # ...of the previous two non-redundant : 0
% 0.15/0.42  # ...aggressively subsumed             : 0
% 0.15/0.42  # Contextual simplify-reflections      : 0
% 0.15/0.42  # Paramodulations                      : 0
% 0.15/0.42  # Factorizations                       : 0
% 0.15/0.42  # NegExts                              : 0
% 0.15/0.42  # Equation resolutions                 : 0
% 0.15/0.42  # Total rewrite steps                  : 1
% 0.15/0.42  # Propositional unsat checks           : 0
% 0.15/0.42  #    Propositional check models        : 0
% 0.15/0.42  #    Propositional check unsatisfiable : 0
% 0.15/0.42  #    Propositional clauses             : 0
% 0.15/0.42  #    Propositional clauses after purity: 0
% 0.15/0.42  #    Propositional unsat core size     : 0
% 0.15/0.42  #    Propositional preprocessing time  : 0.000
% 0.15/0.42  #    Propositional encoding time       : 0.000
% 0.15/0.42  #    Propositional solver time         : 0.000
% 0.15/0.42  #    Success case prop preproc time    : 0.000
% 0.15/0.42  #    Success case prop encoding time   : 0.000
% 0.15/0.42  #    Success case prop solver time     : 0.000
% 0.15/0.42  # Current number of processed clauses  : 2
% 0.15/0.42  #    Positive orientable unit clauses  : 2
% 0.15/0.42  #    Positive unorientable unit clauses: 0
% 0.15/0.42  #    Negative unit clauses             : 0
% 0.15/0.42  #    Non-unit-clauses                  : 0
% 0.15/0.42  # Current number of unprocessed clauses: 70
% 0.15/0.42  # ...number of literals in the above   : 140
% 0.15/0.42  # Current number of archived formulas  : 0
% 0.15/0.42  # Current number of archived clauses   : 0
% 0.15/0.42  # Clause-clause subsumption calls (NU) : 0
% 0.15/0.42  # Rec. Clause-clause subsumption calls : 0
% 0.15/0.42  # Non-unit clause-clause subsumptions  : 0
% 0.15/0.42  # Unit Clause-clause subsumption calls : 0
% 0.15/0.42  # Rewrite failures with RHS unbound    : 0
% 0.15/0.42  # BW rewrite match attempts            : 0
% 0.15/0.42  # BW rewrite match successes           : 0
% 0.15/0.42  # Condensation attempts                : 0
% 0.15/0.42  # Condensation successes               : 0
% 0.15/0.42  # Termbank termtop insertions          : 3672
% 0.15/0.42  
% 0.15/0.42  # -------------------------------------------------
% 0.15/0.42  # User time                : 0.001 s
% 0.15/0.42  # System time              : 0.004 s
% 0.15/0.42  # Total time               : 0.005 s
% 0.15/0.42  # Maximum resident set size: 2096 pages
% 0.15/0.42  
% 0.15/0.42  # -------------------------------------------------
% 0.15/0.42  # User time                : 0.003 s
% 0.15/0.42  # System time              : 0.007 s
% 0.15/0.42  # Total time               : 0.010 s
% 0.15/0.42  # Maximum resident set size: 1796 pages
% 0.15/0.42  % E---3.1 exiting
% 0.15/0.42  % E---3.1 exiting
%------------------------------------------------------------------------------