↑ Up

E---3.5.1.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E---3.5.1
% Problem  : SWV121+1 : TPTP v9.3.1. Bugfixed v3.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM

% Computer : n015.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8046.5625MB
% OS       : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Thu Sep 24 02:53:45 PM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
fof(quaternion_ds1_symm_0014,conjecture,
    ( ( ! [X21,X22] :
          ( ( leq(X22,minus(n6,n1))
            & leq(X21,minus(n6,n1))
            & leq(n0,X22)
            & leq(n0,X21) )
         => a_select3(pminus_ds1_filter,X21,X22) = a_select3(pminus_ds1_filter,X22,X21) )
      & ! [X4,X20] :
          ( ( leq(X20,minus(n3,n1))
            & leq(X4,minus(n3,n1))
            & leq(n0,X20)
            & leq(n0,X4) )
         => a_select3(r_ds1_filter,X4,X20) = a_select3(r_ds1_filter,X20,X4) )
      & ! [X14,X18] :
          ( ( leq(X18,minus(n6,n1))
            & leq(X14,minus(n6,n1))
            & leq(n0,X18)
            & leq(n0,X14) )
         => a_select3(q_ds1_filter,X14,X18) = a_select3(q_ds1_filter,X18,X14) ) )
   => true ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',quaternion_ds1_symm_0014) ).

fof(ttrue,axiom,
    true,
    file('/export/starexec/sandbox/benchmark/Axioms/SWV003+0.ax',ttrue) ).

fof(c_0_2,negated_conjecture,
    ~ ( ( ! [X21,X22] :
            ( ( leq(X22,minus(n6,n1))
              & leq(X21,minus(n6,n1))
              & leq(n0,X22)
              & leq(n0,X21) )
           => a_select3(pminus_ds1_filter,X21,X22) = a_select3(pminus_ds1_filter,X22,X21) )
        & ! [X4,X20] :
            ( ( leq(X20,minus(n3,n1))
              & leq(X4,minus(n3,n1))
              & leq(n0,X20)
              & leq(n0,X4) )
           => a_select3(r_ds1_filter,X4,X20) = a_select3(r_ds1_filter,X20,X4) )
        & ! [X14,X18] :
            ( ( leq(X18,minus(n6,n1))
              & leq(X14,minus(n6,n1))
              & leq(n0,X18)
              & leq(n0,X14) )
           => a_select3(q_ds1_filter,X14,X18) = a_select3(q_ds1_filter,X18,X14) ) )
     => true ),
    inference(assume_negation,[status(cth)],[quaternion_ds1_symm_0014]) ).

fof(c_0_3,plain,
    ( epred1_0
  <=> ( ! [X21,X22] :
          ( ( leq(X22,minus(n6,n1))
            & leq(X21,minus(n6,n1))
            & leq(n0,X22)
            & leq(n0,X21) )
         => a_select3(pminus_ds1_filter,X21,X22) = a_select3(pminus_ds1_filter,X22,X21) )
      & ! [X4,X20] :
          ( ( leq(X20,minus(n3,n1))
            & leq(X4,minus(n3,n1))
            & leq(n0,X20)
            & leq(n0,X4) )
         => a_select3(r_ds1_filter,X4,X20) = a_select3(r_ds1_filter,X20,X4) )
      & ! [X14,X18] :
          ( ( leq(X18,minus(n6,n1))
            & leq(X14,minus(n6,n1))
            & leq(n0,X18)
            & leq(n0,X14) )
         => a_select3(q_ds1_filter,X14,X18) = a_select3(q_ds1_filter,X18,X14) ) ) ),
    introduced(definition) ).

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

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

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

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

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SWV121+1 : TPTP v9.3.1. Bugfixed v3.3.0.
% 0.00/0.04  % Command  : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.59  % Computer : n015.cluster.edu
% 0.09/0.59  % Model    : x86_64 x86_64
% 0.09/0.59  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.59  % Memory   : 8046.5625MB
% 0.09/0.59  % OS       : Linux 6.8.0-71-generic
% 0.09/0.59  % CPULimit : 300
% 0.09/0.59  % WCLimit  : 300
% 0.09/0.59  % DateTime : Mon Sep 21 08:35:22 UTC 2026
% 0.09/0.59  % CPUTime  : 
% 0.09/0.59  Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.14/0.63  Running first-order theorem proving
% 0.14/0.63  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/benchmark/theBenchmark.p
% 0.14/0.65  % Version: 3.5.1
% 0.14/0.65  % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.14/0.65  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.65  % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.14/0.65  % Starting new_bool_3 with 300s (1) cores
% 0.14/0.65  % Starting new_bool_1 with 300s (1) cores
% 0.14/0.65  % Starting sh5l with 300s (1) cores
% 0.14/0.65  % new_bool_3 with pid 1049969 completed with status 0
% 0.14/0.65  % Result found by new_bool_3
% 0.14/0.65  % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.14/0.65  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.65  % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.14/0.65  % Starting new_bool_3 with 300s (1) cores
% 0.14/0.65  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.14/0.65  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.14/0.65  % Search class: FGUSM-FFMM31-DFFFFFNN
% 0.14/0.65  % partial match(1): FGHSM-FFMM31-DFFFFFNN
% 0.14/0.65  % Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.14/0.65  % Starting SubtermCWHack with 31s (1) cores
% 0.14/0.65  % SubtermCWHack with pid 1049972 completed with status 0
% 0.14/0.65  % Result found by SubtermCWHack
% 0.14/0.65  % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.14/0.65  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.65  % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.14/0.65  % Starting new_bool_3 with 300s (1) cores
% 0.14/0.65  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.14/0.65  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.14/0.65  % Search class: FGUSM-FFMM31-DFFFFFNN
% 0.14/0.65  % partial match(1): FGHSM-FFMM31-DFFFFFNN
% 0.14/0.65  % Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.14/0.65  % Starting SubtermCWHack with 31s (1) cores
% 0.14/0.65  % Preprocessing time       : 0.002 s
% 0.14/0.65  
% 0.14/0.65  % Proof found!
% 0.14/0.65  % SZS status Theorem
% 0.14/0.65  % SZS output start CNFRefutation
% See solution above
% 0.14/0.65  % Parsed axioms                        : 94
% 0.14/0.65  % Removed by relevancy pruning/SinE    : 23
% 0.14/0.65  % Initial clauses                      : 78
% 0.14/0.65  % Removed in clause preprocessing      : 0
% 0.14/0.65  % Initial clauses in saturation        : 78
% 0.14/0.65  % Processed clauses                    : 3
% 0.14/0.65  % ...of these trivial                  : 0
% 0.14/0.65  % ...subsumed                          : 0
% 0.14/0.65  % ...remaining for further processing  : 2
% 0.14/0.65  % Other redundant clauses eliminated   : 0
% 0.14/0.65  % Clauses deleted for lack of memory   : 0
% 0.14/0.65  % Backward-subsumed                    : 0
% 0.14/0.65  % Backward-rewritten                   : 0
% 0.14/0.65  % Generated clauses                    : 0
% 0.14/0.65  % ...of the previous two non-redundant : 0
% 0.14/0.65  % ...aggressively subsumed             : 0
% 0.14/0.65  % Contextual simplify-reflections      : 0
% 0.14/0.65  % Paramodulations                      : 0
% 0.14/0.65  % Factorizations                       : 0
% 0.14/0.65  % NegExts                              : 0
% 0.14/0.65  % Equation resolutions                 : 0
% 0.14/0.65  % Disequality decompositions           : 0
% 0.14/0.65  % Total rewrite steps                  : 1
% 0.14/0.65  % ...of those cached                   : 0
% 0.14/0.65  % Propositional unsat checks           : 0
% 0.14/0.65  %    Propositional check models        : 0
% 0.14/0.65  %    Propositional check unsatisfiable : 0
% 0.14/0.65  %    Propositional clauses             : 0
% 0.14/0.65  %    Propositional clauses after purity: 0
% 0.14/0.65  %    Propositional unsat core size     : 0
% 0.14/0.65  %    Propositional preprocessing time  : 0.000
% 0.14/0.65  %    Propositional encoding time       : 0.000
% 0.14/0.65  %    Propositional solver time         : 0.000
% 0.14/0.65  %    Success case prop preproc time    : 0.000
% 0.14/0.65  %    Success case prop encoding time   : 0.000
% 0.14/0.65  %    Success case prop solver time     : 0.000
% 0.14/0.65  % Current number of processed clauses  : 2
% 0.14/0.65  %    Positive orientable unit clauses  : 2
% 0.14/0.65  %    Positive unorientable unit clauses: 0
% 0.14/0.65  %    Negative unit clauses             : 0
% 0.14/0.65  %    Non-unit-clauses                  : 0
% 0.14/0.65  % Current number of unprocessed clauses: 75
% 0.14/0.65  % ...number of literals in the above   : 143
% 0.14/0.65  % Current number of archived formulas  : 0
% 0.14/0.65  % Current number of archived clauses   : 0
% 0.14/0.65  % Clause-clause subsumption calls (NU) : 0
% 0.14/0.65  % Rec. Clause-clause subsumption calls : 0
% 0.14/0.65  % Non-unit clause-clause subsumptions  : 0
% 0.14/0.65  % Unit Clause-clause subsumption calls : 0
% 0.14/0.65  % Rewrite failures with RHS unbound    : 0
% 0.14/0.65  % BW rewrite match attempts            : 0
% 0.14/0.65  % BW rewrite match successes           : 0
% 0.14/0.65  % Condensation attempts                : 0
% 0.14/0.65  % Condensation successes               : 0
% 0.14/0.65  % Termbank termtop insertions          : 4227
% 0.14/0.65  % Search garbage collected termcells   : 718
% 0.14/0.65  
% 0.14/0.65  % -------------------------------------------------
% 0.14/0.65  % User time                : 0.002 s
% 0.14/0.65  % System time              : 0.005 s
% 0.14/0.65  % Total time               : 0.008 s
% 0.14/0.65  % Maximum resident set size: 4004 pages
% 0.14/0.65  
% 0.14/0.65  % -------------------------------------------------
% 0.14/0.65  % User time                : 0.005 s
% 0.14/0.65  % System time              : 0.011 s
% 0.14/0.65  % Total time               : 0.016 s
% 0.14/0.65  % Maximum resident set size: 4608 pages
% 0.14/0.65  % E exiting
%------------------------------------------------------------------------------