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

View Problem - Process Solution

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

% Computer : n021.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:29 EDT 2023

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

% Comments : 
%------------------------------------------------------------------------------
fof(quaternion_ds1_symm_0016,conjecture,
    ( geq(minus(n3,n1),n0)
   => ( geq(minus(n6,n1),n0)
     => ( ( geq(n2,n0)
          & geq(minus(n999,n1),n0) )
       => ( geq(minus(n6,n1),n0)
         => ( geq(minus(n6,n1),n0)
           => ( geq(minus(n6,n1),n0)
             => ( ( geq(minus(n3,n1),n0)
                  & geq(minus(n999,n1),n0) )
               => true ) ) ) ) ) ) ),
    file('/export/starexec/sandbox/tmp/tmp.UpoVpawzJ9/E---3.1_31456.p',quaternion_ds1_symm_0016) ).

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

fof(c_0_2,negated_conjecture,
    ~ ( geq(minus(n3,n1),n0)
     => ( geq(minus(n6,n1),n0)
       => ( ( geq(n2,n0)
            & geq(minus(n999,n1),n0) )
         => ( geq(minus(n6,n1),n0)
           => ( geq(minus(n6,n1),n0)
             => ( geq(minus(n6,n1),n0)
               => ( ( geq(minus(n3,n1),n0)
                    & geq(minus(n999,n1),n0) )
                 => true ) ) ) ) ) ) ),
    inference(assume_negation,[status(cth)],[quaternion_ds1_symm_0016]) ).

fof(c_0_3,negated_conjecture,
    ( geq(minus(n3,n1),n0)
    & geq(minus(n6,n1),n0)
    & geq(n2,n0)
    & geq(minus(n999,n1),n0)
    & geq(minus(n6,n1),n0)
    & geq(minus(n6,n1),n0)
    & geq(minus(n6,n1),n0)
    & geq(minus(n3,n1),n0)
    & geq(minus(n999,n1),n0)
    & ~ true ),
    inference(fof_nnf,[status(thm)],[c_0_2]) ).

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

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

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

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