TSTP Solution File: CSR018+1 by Beagle---0.9.51

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Beagle---0.9.51
% Problem  : CSR018+1 : TPTP v8.1.2. Bugfixed v3.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : java -Dfile.encoding=UTF-8 -Xms512M -Xmx4G -Xss10M -jar /export/starexec/sandbox/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s

% Computer : n011.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 Aug 22 10:35:33 EDT 2023

% Result   : Theorem 10.40s 3.46s
% Output   : CNFRefutation 10.40s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :   49
% Syntax   : Number of formulae    :   82 (  22 unt;  36 typ;   0 def)
%            Number of atoms       :  115 (  42 equ)
%            Maximal formula atoms :   19 (   2 avg)
%            Number of connectives :  105 (  36   ~;  35   |;  25   &)
%                                         (   7 <=>;   2  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   13 (   3 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :   55 (  21   >;  34   *;   0   +;   0  <<)
%            Number of predicates  :   14 (  12 usr;   1 prp; 0-4 aty)
%            Number of functors    :   24 (  24 usr;  15 con; 0-3 aty)
%            Number of variables   :   39 (;  38   !;   1   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
%$ trajectory > antitrajectory > terminates > stoppedIn > startedIn > releases > initiates > releasedAt > less_or_equal > less > holdsAt > happens > plus > #nlpp > spinning > push > pull > n9 > n8 > n7 > n6 > n5 > n4 > n3 > n2 > n1 > n0 > forwards > backwards > #skF_6 > #skF_1 > #skF_4 > #skF_2 > #skF_8 > #skF_3 > #skF_7 > #skF_5

%Foreground sorts:

%Background operators:

%Foreground operators:
tff(backwards,type,
    backwards: $i ).

tff(less_or_equal,type,
    less_or_equal: ( $i * $i ) > $o ).

tff('#skF_6',type,
    '#skF_6': ( $i * $i ) > $i ).

tff(stoppedIn,type,
    stoppedIn: ( $i * $i * $i ) > $o ).

tff('#skF_1',type,
    '#skF_1': ( $i * $i * $i ) > $i ).

tff(terminates,type,
    terminates: ( $i * $i * $i ) > $o ).

tff(releasedAt,type,
    releasedAt: ( $i * $i ) > $o ).

tff(n8,type,
    n8: $i ).

tff(forwards,type,
    forwards: $i ).

tff(n9,type,
    n9: $i ).

tff('#skF_4',type,
    '#skF_4': ( $i * $i * $i ) > $i ).

tff(startedIn,type,
    startedIn: ( $i * $i * $i ) > $o ).

tff(n3,type,
    n3: $i ).

tff(trajectory,type,
    trajectory: ( $i * $i * $i * $i ) > $o ).

tff(n1,type,
    n1: $i ).

tff(less,type,
    less: ( $i * $i ) > $o ).

tff(plus,type,
    plus: ( $i * $i ) > $i ).

tff(n7,type,
    n7: $i ).

tff(n6,type,
    n6: $i ).

tff('#skF_2',type,
    '#skF_2': ( $i * $i * $i ) > $i ).

tff(n0,type,
    n0: $i ).

tff('#skF_8',type,
    '#skF_8': ( $i * $i ) > $i ).

tff(antitrajectory,type,
    antitrajectory: ( $i * $i * $i * $i ) > $o ).

tff(happens,type,
    happens: ( $i * $i ) > $o ).

tff(initiates,type,
    initiates: ( $i * $i * $i ) > $o ).

tff(n4,type,
    n4: $i ).

tff(pull,type,
    pull: $i ).

tff('#skF_3',type,
    '#skF_3': ( $i * $i * $i ) > $i ).

tff(releases,type,
    releases: ( $i * $i * $i ) > $o ).

tff(holdsAt,type,
    holdsAt: ( $i * $i ) > $o ).

tff(push,type,
    push: $i ).

tff('#skF_7',type,
    '#skF_7': ( $i * $i ) > $i ).

tff(n2,type,
    n2: $i ).

tff(n5,type,
    n5: $i ).

tff(spinning,type,
    spinning: $i ).

tff('#skF_5',type,
    '#skF_5': ( $i * $i ) > $i ).

tff(f_334,axiom,
    ~ ? [X] : less(X,n0),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',less0) ).

tff(f_378,axiom,
    ! [X,Y] :
      ( less(X,Y)
    <=> ( ~ less(Y,X)
        & ( Y != X ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',less_property) ).

tff(f_304,axiom,
    push != pull,
    file('/export/starexec/sandbox/benchmark/Axioms/CSR001+2.ax',push_not_pull) ).

tff(f_301,axiom,
    ! [Event,Time] :
      ( happens(Event,Time)
    <=> ( ( ( Event = push )
          & ( Time = n0 ) )
        | ( ( Event = pull )
          & ( Time = n1 ) )
        | ( ( Event = pull )
          & ( Time = n2 ) )
        | ( ( Event = push )
          & ( Time = n2 ) ) ) ),
    file('/export/starexec/sandbox/benchmark/Axioms/CSR001+2.ax',happens_all_defn) ).

tff(f_280,axiom,
    ! [Event,Fluent,Time] :
      ( terminates(Event,Fluent,Time)
    <=> ( ( ( Event = push )
          & ( Fluent = backwards )
          & ~ happens(pull,Time) )
        | ( ( Event = pull )
          & ( Fluent = forwards )
          & ~ happens(push,Time) )
        | ( ( Event = pull )
          & ( Fluent = forwards )
          & happens(push,Time) )
        | ( ( Event = pull )
          & ( Fluent = backwards )
          & happens(push,Time) )
        | ( ( Event = push )
          & ( Fluent = spinning )
          & ~ happens(pull,Time) )
        | ( ( Event = pull )
          & ( Fluent = spinning )
          & ~ happens(push,Time) ) ) ),
    file('/export/starexec/sandbox/benchmark/Axioms/CSR001+2.ax',terminates_all_defn) ).

tff(f_318,axiom,
    plus(n1,n1) = n2,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',plus1_1) ).

tff(f_174,axiom,
    ! [Event,Time,Fluent] :
      ( ( happens(Event,Time)
        & terminates(Event,Fluent,Time) )
     => ~ holdsAt(Fluent,plus(Time,n1)) ),
    file('/export/starexec/sandbox/benchmark/Axioms/CSR001+0.ax',happens_terminates_not_holds) ).

tff(f_390,negated_conjecture,
    ~ holdsAt(backwards,n2),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',backwards_2) ).

tff(f_238,axiom,
    ! [Event,Fluent,Time] :
      ( initiates(Event,Fluent,Time)
    <=> ( ( ( Event = push )
          & ( Fluent = forwards )
          & ~ happens(pull,Time) )
        | ( ( Event = pull )
          & ( Fluent = backwards )
          & ~ happens(push,Time) )
        | ( ( Event = pull )
          & ( Fluent = spinning )
          & happens(push,Time) ) ) ),
    file('/export/starexec/sandbox/benchmark/Axioms/CSR001+2.ax',initiates_all_defn) ).

tff(f_166,axiom,
    ! [Event,Time,Fluent] :
      ( ( happens(Event,Time)
        & initiates(Event,Fluent,Time) )
     => holdsAt(Fluent,plus(Time,n1)) ),
    file('/export/starexec/sandbox/benchmark/Axioms/CSR001+0.ax',happens_holds) ).

tff(f_331,axiom,
    ! [X,Y] :
      ( less_or_equal(X,Y)
    <=> ( less(X,Y)
        | ( X = Y ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',less_or_equal) ).

tff(f_342,axiom,
    ! [X] :
      ( less(X,n2)
    <=> less_or_equal(X,n1) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',less2) ).

tff(f_338,axiom,
    ! [X] :
      ( less(X,n1)
    <=> less_or_equal(X,n0) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',less1) ).

tff(c_1660,plain,
    ! [X_68] : ~ less(X_68,n0),
    inference(cnfTransformation,[status(thm)],[f_334]) ).

tff(c_1700,plain,
    ! [Y_79] : ~ less(Y_79,Y_79),
    inference(cnfTransformation,[status(thm)],[f_378]) ).

tff(c_1624,plain,
    push != pull,
    inference(cnfTransformation,[status(thm)],[f_304]) ).

tff(c_1620,plain,
    happens(pull,n1),
    inference(cnfTransformation,[status(thm)],[f_301]) ).

tff(c_1576,plain,
    ! [Time_58] :
      ( ~ happens(push,Time_58)
      | terminates(pull,forwards,Time_58) ),
    inference(cnfTransformation,[status(thm)],[f_280]) ).

tff(c_1640,plain,
    plus(n1,n1) = n2,
    inference(cnfTransformation,[status(thm)],[f_318]) ).

tff(c_4018,plain,
    ! [Fluent_219,Time_220,Event_221] :
      ( ~ holdsAt(Fluent_219,plus(Time_220,n1))
      | ~ terminates(Event_221,Fluent_219,Time_220)
      | ~ happens(Event_221,Time_220) ),
    inference(cnfTransformation,[status(thm)],[f_174]) ).

tff(c_4876,plain,
    ! [Fluent_260,Event_261] :
      ( ~ holdsAt(Fluent_260,n2)
      | ~ terminates(Event_261,Fluent_260,n1)
      | ~ happens(Event_261,n1) ),
    inference(superposition,[status(thm),theory(equality)],[c_1640,c_4018]) ).

tff(c_4888,plain,
    ( ~ holdsAt(forwards,n2)
    | ~ happens(pull,n1)
    | ~ happens(push,n1) ),
    inference(resolution,[status(thm)],[c_1576,c_4876]) ).

tff(c_4908,plain,
    ( ~ holdsAt(forwards,n2)
    | ~ happens(push,n1) ),
    inference(demodulation,[status(thm),theory(equality)],[c_1620,c_4888]) ).

tff(c_4917,plain,
    ~ happens(push,n1),
    inference(splitLeft,[status(thm)],[c_4908]) ).

tff(c_1712,plain,
    ~ holdsAt(backwards,n2),
    inference(cnfTransformation,[status(thm)],[f_390]) ).

tff(c_108,plain,
    ! [Time_55] :
      ( happens(push,Time_55)
      | initiates(pull,backwards,Time_55) ),
    inference(cnfTransformation,[status(thm)],[f_238]) ).

tff(c_3933,plain,
    ! [Fluent_213,Time_214,Event_215] :
      ( holdsAt(Fluent_213,plus(Time_214,n1))
      | ~ initiates(Event_215,Fluent_213,Time_214)
      | ~ happens(Event_215,Time_214) ),
    inference(cnfTransformation,[status(thm)],[f_166]) ).

tff(c_7265,plain,
    ! [Time_373] :
      ( holdsAt(backwards,plus(Time_373,n1))
      | ~ happens(pull,Time_373)
      | happens(push,Time_373) ),
    inference(resolution,[status(thm)],[c_108,c_3933]) ).

tff(c_7280,plain,
    ( holdsAt(backwards,n2)
    | ~ happens(pull,n1)
    | happens(push,n1) ),
    inference(superposition,[status(thm),theory(equality)],[c_1640,c_7265]) ).

tff(c_7287,plain,
    ( holdsAt(backwards,n2)
    | happens(push,n1) ),
    inference(demodulation,[status(thm),theory(equality)],[c_1620,c_7280]) ).

tff(c_7289,plain,
    $false,
    inference(negUnitSimplification,[status(thm)],[c_4917,c_1712,c_7287]) ).

tff(c_7291,plain,
    happens(push,n1),
    inference(splitRight,[status(thm)],[c_4908]) ).

tff(c_1596,plain,
    ! [Time_63,Event_62] :
      ( ( n0 = Time_63 )
      | ( pull = Event_62 )
      | ( n2 = Time_63 )
      | ~ happens(Event_62,Time_63) ),
    inference(cnfTransformation,[status(thm)],[f_301]) ).

tff(c_7300,plain,
    ( ( n1 = n0 )
    | ( push = pull )
    | ( n2 = n1 ) ),
    inference(resolution,[status(thm)],[c_7291,c_1596]) ).

tff(c_7310,plain,
    ( ( n1 = n0 )
    | ( n2 = n1 ) ),
    inference(negUnitSimplification,[status(thm)],[c_1624,c_7300]) ).

tff(c_7315,plain,
    n2 = n1,
    inference(splitLeft,[status(thm)],[c_7310]) ).

tff(c_1656,plain,
    ! [Y_67] : less_or_equal(Y_67,Y_67),
    inference(cnfTransformation,[status(thm)],[f_331]) ).

tff(c_1767,plain,
    ! [X_90] :
      ( less(X_90,n2)
      | ~ less_or_equal(X_90,n1) ),
    inference(cnfTransformation,[status(thm)],[f_342]) ).

tff(c_1772,plain,
    less(n1,n2),
    inference(resolution,[status(thm)],[c_1656,c_1767]) ).

tff(c_7387,plain,
    less(n1,n1),
    inference(demodulation,[status(thm),theory(equality)],[c_7315,c_1772]) ).

tff(c_7405,plain,
    $false,
    inference(negUnitSimplification,[status(thm)],[c_1700,c_7387]) ).

tff(c_7406,plain,
    n1 = n0,
    inference(splitRight,[status(thm)],[c_7310]) ).

tff(c_1877,plain,
    ! [X_106] :
      ( less(X_106,n1)
      | ~ less_or_equal(X_106,n0) ),
    inference(cnfTransformation,[status(thm)],[f_338]) ).

tff(c_1882,plain,
    less(n0,n1),
    inference(resolution,[status(thm)],[c_1656,c_1877]) ).

tff(c_7442,plain,
    less(n0,n0),
    inference(demodulation,[status(thm),theory(equality)],[c_7406,c_1882]) ).

tff(c_7455,plain,
    $false,
    inference(negUnitSimplification,[status(thm)],[c_1660,c_7442]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13  % Problem  : CSR018+1 : TPTP v8.1.2. Bugfixed v3.1.0.
% 0.00/0.14  % Command  : java -Dfile.encoding=UTF-8 -Xms512M -Xmx4G -Xss10M -jar /export/starexec/sandbox/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s
% 0.17/0.35  % Computer : n011.cluster.edu
% 0.17/0.35  % Model    : x86_64 x86_64
% 0.17/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.35  % Memory   : 8042.1875MB
% 0.17/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.17/0.35  % CPULimit : 300
% 0.17/0.35  % WCLimit  : 300
% 0.17/0.35  % DateTime : Thu Aug  3 21:00:36 EDT 2023
% 0.17/0.35  % CPUTime  : 
% 10.40/3.46  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 10.40/3.47  
% 10.40/3.47  % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 10.40/3.50  
% 10.40/3.50  Inference rules
% 10.40/3.50  ----------------------
% 10.40/3.50  #Ref     : 0
% 10.40/3.50  #Sup     : 1009
% 10.40/3.50  #Fact    : 2
% 10.40/3.50  #Define  : 0
% 10.40/3.50  #Split   : 32
% 10.40/3.50  #Chain   : 0
% 10.40/3.50  #Close   : 0
% 10.40/3.50  
% 10.40/3.50  Ordering : KBO
% 10.40/3.50  
% 10.40/3.50  Simplification rules
% 10.40/3.50  ----------------------
% 10.40/3.50  #Subsume      : 772
% 10.40/3.50  #Demod        : 634
% 10.40/3.50  #Tautology    : 683
% 10.40/3.50  #SimpNegUnit  : 279
% 10.40/3.50  #BackRed      : 348
% 10.40/3.50  
% 10.40/3.50  #Partial instantiations: 0
% 10.40/3.50  #Strategies tried      : 1
% 10.40/3.50  
% 10.40/3.50  Timing (in seconds)
% 10.40/3.50  ----------------------
% 10.40/3.50  Preprocessing        : 0.95
% 10.40/3.50  Parsing              : 0.40
% 10.40/3.50  CNF conversion       : 0.09
% 10.40/3.50  Main loop            : 1.48
% 10.40/3.50  Inferencing          : 0.41
% 10.40/3.50  Reduction            : 0.52
% 10.40/3.50  Demodulation         : 0.33
% 10.40/3.51  BG Simplification    : 0.14
% 10.40/3.51  Subsumption          : 0.40
% 10.40/3.51  Abstraction          : 0.04
% 10.40/3.51  MUC search           : 0.00
% 10.40/3.51  Cooper               : 0.00
% 10.40/3.51  Total                : 2.49
% 10.40/3.51  Index Insertion      : 0.00
% 10.40/3.51  Index Deletion       : 0.00
% 10.40/3.51  Index Matching       : 0.00
% 10.40/3.51  BG Taut test         : 0.00
%------------------------------------------------------------------------------