TSTP Solution File: CSR021+1 by Leo-III-SAT---1.7.10

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Leo-III-SAT---1.7.10
% Problem  : CSR021+1 : TPTP v8.1.2. Bugfixed v3.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_Leo-III %s %d

% Computer : n024.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 : 300s
% WCLimit  : 300s
% DateTime : Tue May  7 10:28:26 EDT 2024

% Result   : Theorem 74.98s 12.50s
% Output   : Refutation 74.98s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   14
%            Number of leaves      :   19
% Syntax   : Number of formulae    :   55 (  18 unt;  13 typ;   0 def)
%            Number of atoms       :  216 ( 131 equ;   0 cnn)
%            Maximal formula atoms :   38 (   5 avg)
%            Number of connectives :  468 (  68   ~;  70   |;  86   &; 232   @)
%                                         (   2 <=>;  10  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   16 (   6 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :    9 (   9   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :   16 (  13 usr;  11 con; 0-3 aty)
%            Number of variables   :   65 (   0   ^  65   !;   0   ?;  65   :)

% Comments : 
%------------------------------------------------------------------------------
thf(holdsAt_type,type,
    holdsAt: $i > $i > $o ).

thf(backwards_type,type,
    backwards: $i ).

thf(n3_type,type,
    n3: $i ).

thf(plus_type,type,
    plus: $i > $i > $i ).

thf(n1_type,type,
    n1: $i ).

thf(n0_type,type,
    n0: $i ).

thf(happens_type,type,
    happens: $i > $i > $o ).

thf(push_type,type,
    push: $i ).

thf(pull_type,type,
    pull: $i ).

thf(n2_type,type,
    n2: $i ).

thf(terminates_type,type,
    terminates: $i > $i > $i > $o ).

thf(forwards_type,type,
    forwards: $i ).

thf(spinning_type,type,
    spinning: $i ).

thf(46,axiom,
    ! [A: $i,B: $i,C: $i] :
      ( ( terminates @ A @ B @ C )
    <=> ( ( ( A = push )
          & ( B = backwards )
          & ~ ( happens @ pull @ C ) )
        | ( ( A = pull )
          & ( B = forwards )
          & ~ ( happens @ push @ C ) )
        | ( ( A = pull )
          & ( B = forwards )
          & ( happens @ push @ C ) )
        | ( ( A = pull )
          & ( B = backwards )
          & ( happens @ push @ C ) )
        | ( ( A = push )
          & ( B = spinning )
          & ~ ( happens @ pull @ C ) )
        | ( ( A = pull )
          & ( B = spinning )
          & ~ ( happens @ push @ C ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',terminates_all_defn) ).

thf(256,plain,
    ! [A: $i,B: $i,C: $i] :
      ( ( ( terminates @ A @ B @ C )
       => ( ( ( A = push )
            & ( B = backwards )
            & ~ ( happens @ pull @ C ) )
          | ( ( A = pull )
            & ( B = forwards )
            & ~ ( happens @ push @ C ) )
          | ( ( A = pull )
            & ( B = forwards )
            & ( happens @ push @ C ) )
          | ( ( A = pull )
            & ( B = backwards )
            & ( happens @ push @ C ) )
          | ( ( A = push )
            & ( B = spinning )
            & ~ ( happens @ pull @ C ) )
          | ( ( A = pull )
            & ( B = spinning )
            & ~ ( happens @ push @ C ) ) ) )
      & ( ( ( ( A = push )
            & ( B = backwards )
            & ~ ( happens @ pull @ C ) )
          | ( ( A = pull )
            & ( B = forwards )
            & ~ ( happens @ push @ C ) )
          | ( ( A = pull )
            & ( B = forwards )
            & ( happens @ push @ C ) )
          | ( ( A = pull )
            & ( B = backwards )
            & ( happens @ push @ C ) )
          | ( ( A = push )
            & ( B = spinning )
            & ~ ( happens @ pull @ C ) )
          | ( ( A = pull )
            & ( B = spinning )
            & ~ ( happens @ push @ C ) ) )
       => ( terminates @ A @ B @ C ) ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[46]) ).

thf(257,plain,
    ( ! [A: $i,B: $i,C: $i] :
        ( ( terminates @ A @ B @ C )
       => ( ( ( A = push )
            & ( B = backwards )
            & ~ ( happens @ pull @ C ) )
          | ( ( A = pull )
            & ( B = forwards )
            & ~ ( happens @ push @ C ) )
          | ( ( A = pull )
            & ( B = forwards )
            & ( happens @ push @ C ) )
          | ( ( A = pull )
            & ( B = backwards )
            & ( happens @ push @ C ) )
          | ( ( A = push )
            & ( B = spinning )
            & ~ ( happens @ pull @ C ) )
          | ( ( A = pull )
            & ( B = spinning )
            & ~ ( happens @ push @ C ) ) ) )
    & ! [A: $i,B: $i,C: $i] :
        ( ( ( ( A = push )
            & ( B = backwards )
            & ~ ( happens @ pull @ C ) )
          | ( ( A = pull )
            & ( B = forwards )
            & ~ ( happens @ push @ C ) )
          | ( ( A = pull )
            & ( B = forwards )
            & ( happens @ push @ C ) )
          | ( ( A = pull )
            & ( B = backwards )
            & ( happens @ push @ C ) )
          | ( ( A = push )
            & ( B = spinning )
            & ~ ( happens @ pull @ C ) )
          | ( ( A = pull )
            & ( B = spinning )
            & ~ ( happens @ push @ C ) ) )
       => ( terminates @ A @ B @ C ) ) ),
    inference(miniscope,[status(thm)],[256]) ).

thf(261,plain,
    ! [C: $i,B: $i,A: $i] :
      ( ( A != pull )
      | ( B != backwards )
      | ~ ( happens @ push @ C )
      | ( terminates @ A @ B @ C ) ),
    inference(cnf,[status(esa)],[257]) ).

thf(282,plain,
    ! [C: $i,B: $i,A: $i] :
      ( ( A != pull )
      | ( B != backwards )
      | ~ ( happens @ push @ C )
      | ( terminates @ A @ B @ C ) ),
    inference(lifteq,[status(thm)],[261]) ).

thf(283,plain,
    ! [A: $i] :
      ( ~ ( happens @ push @ A )
      | ( terminates @ pull @ backwards @ A ) ),
    inference(simp,[status(thm)],[282]) ).

thf(9,axiom,
    ! [A: $i,B: $i] :
      ( ( happens @ A @ B )
    <=> ( ( ( A = push )
          & ( B = n0 ) )
        | ( ( A = pull )
          & ( B = n1 ) )
        | ( ( A = pull )
          & ( B = n2 ) )
        | ( ( A = push )
          & ( B = n2 ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',happens_all_defn) ).

thf(78,plain,
    ! [A: $i,B: $i] :
      ( ( ( happens @ A @ B )
       => ( ( ( A = push )
            & ( B = n0 ) )
          | ( ( A = pull )
            & ( B = n1 ) )
          | ( ( A = pull )
            & ( B = n2 ) )
          | ( ( A = push )
            & ( B = n2 ) ) ) )
      & ( ( ( ( A = push )
            & ( B = n0 ) )
          | ( ( A = pull )
            & ( B = n1 ) )
          | ( ( A = pull )
            & ( B = n2 ) )
          | ( ( A = push )
            & ( B = n2 ) ) )
       => ( happens @ A @ B ) ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[9]) ).

thf(79,plain,
    ( ! [A: $i,B: $i] :
        ( ( happens @ A @ B )
       => ( ( ( A = push )
            & ( B = n0 ) )
          | ( ( A = pull )
            & ( B = n1 ) )
          | ( ( A = pull )
            & ( B = n2 ) )
          | ( ( A = push )
            & ( B = n2 ) ) ) )
    & ! [A: $i,B: $i] :
        ( ( ( ( A = push )
            & ( B = n0 ) )
          | ( ( A = pull )
            & ( B = n1 ) )
          | ( ( A = pull )
            & ( B = n2 ) )
          | ( ( A = push )
            & ( B = n2 ) ) )
       => ( happens @ A @ B ) ) ),
    inference(miniscope,[status(thm)],[78]) ).

thf(85,plain,
    ! [B: $i,A: $i] :
      ( ( A != pull )
      | ( B != n2 )
      | ( happens @ A @ B ) ),
    inference(cnf,[status(esa)],[79]) ).

thf(95,plain,
    ! [B: $i,A: $i] :
      ( ( A != pull )
      | ( B != n2 )
      | ( happens @ A @ B ) ),
    inference(lifteq,[status(thm)],[85]) ).

thf(96,plain,
    happens @ pull @ n2,
    inference(simp,[status(thm)],[95]) ).

thf(1,conjecture,
    ~ ( holdsAt @ backwards @ n3 ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',not_backwards_3) ).

thf(2,negated_conjecture,
    ~ ~ ( holdsAt @ backwards @ n3 ),
    inference(neg_conjecture,[status(cth)],[1]) ).

thf(50,plain,
    ~ ~ ( holdsAt @ backwards @ n3 ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[2]) ).

thf(51,plain,
    holdsAt @ backwards @ n3,
    inference(polarity_switch,[status(thm)],[50]) ).

thf(36,axiom,
    ! [A: $i,B: $i,C: $i] :
      ( ( ( happens @ A @ B )
        & ( terminates @ A @ C @ B ) )
     => ~ ( holdsAt @ C @ ( plus @ B @ n1 ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',happens_terminates_not_holds) ).

thf(228,plain,
    ! [A: $i,B: $i,C: $i] :
      ( ( ( happens @ A @ B )
        & ( terminates @ A @ C @ B ) )
     => ~ ( holdsAt @ C @ ( plus @ B @ n1 ) ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[36]) ).

thf(229,plain,
    ! [C: $i,B: $i,A: $i] :
      ( ~ ( happens @ A @ B )
      | ~ ( terminates @ A @ C @ B )
      | ~ ( holdsAt @ C @ ( plus @ B @ n1 ) ) ),
    inference(cnf,[status(esa)],[228]) ).

thf(899,plain,
    ! [C: $i,B: $i,A: $i] :
      ( ~ ( happens @ A @ B )
      | ~ ( terminates @ A @ C @ B )
      | ( ( holdsAt @ backwards @ n3 )
       != ( holdsAt @ C @ ( plus @ B @ n1 ) ) ) ),
    inference(paramod_ordered,[status(thm)],[51,229]) ).

thf(909,plain,
    ! [C: $i,B: $i,A: $i] :
      ( ~ ( happens @ A @ B )
      | ~ ( terminates @ A @ C @ B )
      | ( backwards != C )
      | ( ( plus @ B @ n1 )
       != n3 ) ),
    inference(simp,[status(thm)],[899]) ).

thf(923,plain,
    ! [B: $i,A: $i] :
      ( ~ ( happens @ A @ B )
      | ~ ( terminates @ A @ backwards @ B )
      | ( ( plus @ B @ n1 )
       != n3 ) ),
    inference(simp,[status(thm)],[909]) ).

thf(1003,plain,
    ! [B: $i,A: $i] :
      ( ~ ( terminates @ A @ backwards @ B )
      | ( ( plus @ B @ n1 )
       != n3 )
      | ( ( happens @ pull @ n2 )
       != ( happens @ A @ B ) ) ),
    inference(paramod_ordered,[status(thm)],[96,923]) ).

thf(1004,plain,
    ( ~ ( terminates @ pull @ backwards @ n2 )
    | ( ( plus @ n2 @ n1 )
     != n3 ) ),
    inference(pattern_uni,[status(thm)],[1003:[bind(A,$thf( pull )),bind(B,$thf( n2 ))]]) ).

thf(49,axiom,
    ( ( plus @ n1 @ n2 )
    = n3 ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',plus1_2) ).

thf(311,plain,
    ( ( plus @ n1 @ n2 )
    = n3 ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[49]) ).

thf(312,plain,
    ( ( plus @ n1 @ n2 )
    = n3 ),
    inference(lifteq,[status(thm)],[311]) ).

thf(6,axiom,
    ! [A: $i,B: $i] :
      ( ( plus @ A @ B )
      = ( plus @ B @ A ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',symmetry_of_plus) ).

thf(65,plain,
    ! [A: $i,B: $i] :
      ( ( plus @ A @ B )
      = ( plus @ B @ A ) ),
    inference(defexp_and_simp_and_etaexpand,[status(thm)],[6]) ).

thf(66,plain,
    ! [B: $i,A: $i] :
      ( ( plus @ A @ B )
      = ( plus @ B @ A ) ),
    inference(cnf,[status(esa)],[65]) ).

thf(67,plain,
    ! [B: $i,A: $i] :
      ( ( plus @ A @ B )
      = ( plus @ B @ A ) ),
    inference(lifteq,[status(thm)],[66]) ).

thf(600,plain,
    ! [B: $i,A: $i] :
      ( ( ( plus @ B @ A )
        = n3 )
      | ( ( plus @ n1 @ n2 )
       != ( plus @ A @ B ) ) ),
    inference(paramod_ordered,[status(thm)],[312,67]) ).

thf(601,plain,
    ( ( plus @ n2 @ n1 )
    = n3 ),
    inference(pattern_uni,[status(thm)],[600:[bind(A,$thf( n1 )),bind(B,$thf( n2 ))]]) ).

thf(1054,plain,
    ( ~ ( terminates @ pull @ backwards @ n2 )
    | ( n3 != n3 ) ),
    inference(rewrite,[status(thm)],[1004,601]) ).

thf(1055,plain,
    ~ ( terminates @ pull @ backwards @ n2 ),
    inference(simp,[status(thm)],[1054]) ).

thf(27614,plain,
    ! [A: $i] :
      ( ~ ( happens @ push @ A )
      | ( ( terminates @ pull @ backwards @ A )
       != ( terminates @ pull @ backwards @ n2 ) ) ),
    inference(paramod_ordered,[status(thm)],[283,1055]) ).

thf(27615,plain,
    ~ ( happens @ push @ n2 ),
    inference(pattern_uni,[status(thm)],[27614:[bind(A,$thf( n2 ))]]) ).

thf(86,plain,
    ! [B: $i,A: $i] :
      ( ( A != push )
      | ( B != n2 )
      | ( happens @ A @ B ) ),
    inference(cnf,[status(esa)],[79]) ).

thf(97,plain,
    ! [B: $i,A: $i] :
      ( ( A != push )
      | ( B != n2 )
      | ( happens @ A @ B ) ),
    inference(lifteq,[status(thm)],[86]) ).

thf(98,plain,
    happens @ push @ n2,
    inference(simp,[status(thm)],[97]) ).

thf(28357,plain,
    ~ $true,
    inference(rewrite,[status(thm)],[27615,98]) ).

thf(28358,plain,
    $false,
    inference(simp,[status(thm)],[28357]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.09  % Problem  : CSR021+1 : TPTP v8.1.2. Bugfixed v3.1.0.
% 0.05/0.12  % Command  : run_Leo-III %s %d
% 0.13/0.32  % Computer : n024.cluster.edu
% 0.13/0.32  % Model    : x86_64 x86_64
% 0.13/0.32  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.32  % Memory   : 8042.1875MB
% 0.13/0.32  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.32  % CPULimit : 300
% 0.13/0.32  % WCLimit  : 300
% 0.13/0.32  % DateTime : Mon May  6 23:18:54 EDT 2024
% 0.13/0.32  % CPUTime  : 
% 0.90/0.82  % [INFO] 	 Parsing problem /export/starexec/sandbox2/benchmark/theBenchmark.p ... 
% 1.22/1.00  % [INFO] 	 Parsing done (182ms). 
% 1.22/1.01  % [INFO] 	 Running in sequential loop mode. 
% 1.83/1.28  % [INFO] 	 nitpick registered as external prover. 
% 1.83/1.29  % [INFO] 	 Scanning for conjecture ... 
% 1.99/1.36  % [INFO] 	 Found a conjecture and 47 axioms. Running axiom selection ... 
% 2.05/1.43  % [INFO] 	 Axiom selection finished. Selected 47 axioms (removed 0 axioms). 
% 2.29/1.49  % [INFO] 	 Problem is first-order (TPTP FOF). 
% 2.29/1.50  % [INFO] 	 Type checking passed. 
% 2.29/1.51  % [CONFIG] 	 Using configuration: timeout(300) with strategy<name(default),share(1.0),primSubst(3),sos(false),unifierCount(4),uniDepth(8),boolExt(true),choice(true),renaming(true),funcspec(false), domConstr(0),specialInstances(39),restrictUniAttempts(true),termOrdering(CPO)>.  Searching for refutation ... 
% 74.98/12.50  % [INFO] 	 Killing All external provers ... 
% 74.98/12.50  % Time passed: 12062ms (effective reasoning time: 11483ms)
% 74.98/12.50  % Solved by strategy<name(default),share(1.0),primSubst(3),sos(false),unifierCount(4),uniDepth(8),boolExt(true),choice(true),renaming(true),funcspec(false), domConstr(0),specialInstances(39),restrictUniAttempts(true),termOrdering(CPO)>
% 74.98/12.50  % Axioms used in derivation (5): happens_terminates_not_holds, happens_all_defn, plus1_2, symmetry_of_plus, terminates_all_defn
% 74.98/12.50  % No. of inferences in proof: 42
% 74.98/12.50  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : 12062 ms resp. 11483 ms w/o parsing
% 74.98/12.52  % SZS output start Refutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 74.98/12.52  % [INFO] 	 Killing All external provers ... 
%------------------------------------------------------------------------------