TSTP Solution File: PLA002-1 by Beagle---0.9.51

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Beagle---0.9.51
% Problem  : PLA002-1 : TPTP v8.1.2. Released v1.0.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:53:34 EDT 2023

% Result   : Unsatisfiable 2.73s 1.68s
% Output   : CNFRefutation 2.73s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :   23
% Syntax   : Number of formulae    :   43 (  14 unt;  15 typ;   0 def)
%            Number of atoms       :   46 (   0 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   44 (  26   ~;  18   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    5 (   3 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :   14 (   8   >;   6   *;   0   +;   0  <<)
%            Number of predicates  :    4 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :   12 (  12 usr;   7 con; 0-2 aty)
%            Number of variables   :   26 (;  26   !;   0   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
%$ at > warm > cold > walk > skate > go > drive > climb > #nlpp > s0 > f > e > d > c > b > a

%Foreground sorts:

%Background operators:

%Foreground operators:
tff(walk,type,
    walk: ( $i * $i ) > $i ).

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

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

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

tff(cold,type,
    cold: $i > $o ).

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

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

tff(warm,type,
    warm: $i > $o ).

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

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

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

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

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

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

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

tff(f_31,axiom,
    ! [Situation1,Situation2] :
      ( warm(Situation1)
      | cold(Situation2) ),
    file(unknown,unknown) ).

tff(f_117,axiom,
    ! [S] : ~ at(a,S),
    file(unknown,unknown) ).

tff(f_51,axiom,
    ! [Situation] :
      ( ~ at(b,Situation)
      | at(a,drive(a,Situation)) ),
    file(unknown,unknown) ).

tff(f_83,axiom,
    ! [Situation] :
      ( ~ warm(Situation)
      | ~ at(d,Situation)
      | at(b,climb(b,Situation)) ),
    file(unknown,unknown) ).

tff(f_113,axiom,
    ! [Situation] :
      ( ~ at(f,Situation)
      | at(d,go(d,Situation)) ),
    file(unknown,unknown) ).

tff(f_114,axiom,
    at(f,s0),
    file(unknown,unknown) ).

tff(f_67,axiom,
    ! [Situation] :
      ( ~ cold(Situation)
      | ~ at(c,Situation)
      | at(b,skate(b,Situation)) ),
    file(unknown,unknown) ).

tff(f_93,axiom,
    ! [Situation] :
      ( ~ at(d,Situation)
      | at(c,go(c,Situation)) ),
    file(unknown,unknown) ).

tff(c_2,plain,
    ! [Situation2_2,Situation1_1] :
      ( cold(Situation2_2)
      | warm(Situation1_1) ),
    inference(cnfTransformation,[status(thm)],[f_31]) ).

tff(c_43,plain,
    ! [Situation1_1] : warm(Situation1_1),
    inference(splitLeft,[status(thm)],[c_2]) ).

tff(c_34,plain,
    ! [S_17] : ~ at(a,S_17),
    inference(cnfTransformation,[status(thm)],[f_117]) ).

tff(c_10,plain,
    ! [Situation_6] :
      ( at(a,drive(a,Situation_6))
      | ~ at(b,Situation_6) ),
    inference(cnfTransformation,[status(thm)],[f_51]) ).

tff(c_35,plain,
    ! [Situation_6] : ~ at(b,Situation_6),
    inference(negUnitSimplification,[status(thm)],[c_34,c_10]) ).

tff(c_18,plain,
    ! [Situation_10] :
      ( at(b,climb(b,Situation_10))
      | ~ at(d,Situation_10)
      | ~ warm(Situation_10) ),
    inference(cnfTransformation,[status(thm)],[f_83]) ).

tff(c_36,plain,
    ! [Situation_10] :
      ( ~ at(d,Situation_10)
      | ~ warm(Situation_10) ),
    inference(negUnitSimplification,[status(thm)],[c_35,c_18]) ).

tff(c_47,plain,
    ! [Situation_10] : ~ at(d,Situation_10),
    inference(demodulation,[status(thm),theory(equality)],[c_43,c_36]) ).

tff(c_30,plain,
    ! [Situation_16] :
      ( at(d,go(d,Situation_16))
      | ~ at(f,Situation_16) ),
    inference(cnfTransformation,[status(thm)],[f_113]) ).

tff(c_50,plain,
    ! [Situation_16] : ~ at(f,Situation_16),
    inference(negUnitSimplification,[status(thm)],[c_47,c_30]) ).

tff(c_32,plain,
    at(f,s0),
    inference(cnfTransformation,[status(thm)],[f_114]) ).

tff(c_52,plain,
    $false,
    inference(negUnitSimplification,[status(thm)],[c_50,c_32]) ).

tff(c_53,plain,
    ! [Situation2_2] : cold(Situation2_2),
    inference(splitRight,[status(thm)],[c_2]) ).

tff(c_14,plain,
    ! [Situation_8] :
      ( at(b,skate(b,Situation_8))
      | ~ at(c,Situation_8)
      | ~ cold(Situation_8) ),
    inference(cnfTransformation,[status(thm)],[f_67]) ).

tff(c_37,plain,
    ! [Situation_8] :
      ( ~ at(c,Situation_8)
      | ~ cold(Situation_8) ),
    inference(negUnitSimplification,[status(thm)],[c_35,c_14]) ).

tff(c_56,plain,
    ! [Situation_8] : ~ at(c,Situation_8),
    inference(demodulation,[status(thm),theory(equality)],[c_53,c_37]) ).

tff(c_22,plain,
    ! [Situation_12] :
      ( at(c,go(c,Situation_12))
      | ~ at(d,Situation_12) ),
    inference(cnfTransformation,[status(thm)],[f_93]) ).

tff(c_59,plain,
    ! [Situation_12] : ~ at(d,Situation_12),
    inference(negUnitSimplification,[status(thm)],[c_56,c_22]) ).

tff(c_61,plain,
    ! [Situation_16] : ~ at(f,Situation_16),
    inference(negUnitSimplification,[status(thm)],[c_59,c_30]) ).

tff(c_63,plain,
    $false,
    inference(negUnitSimplification,[status(thm)],[c_61,c_32]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.14  % Problem  : PLA002-1 : TPTP v8.1.2. Released v1.0.0.
% 0.00/0.15  % 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.16/0.37  % Computer : n011.cluster.edu
% 0.16/0.37  % Model    : x86_64 x86_64
% 0.16/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.37  % Memory   : 8042.1875MB
% 0.16/0.37  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.16/0.37  % CPULimit : 300
% 0.16/0.37  % WCLimit  : 300
% 0.16/0.37  % DateTime : Thu Aug  3 18:20:06 EDT 2023
% 0.16/0.37  % CPUTime  : 
% 2.73/1.68  % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.73/1.68  
% 2.73/1.68  % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 2.73/1.71  
% 2.73/1.71  Inference rules
% 2.73/1.71  ----------------------
% 2.73/1.71  #Ref     : 0
% 2.73/1.71  #Sup     : 0
% 2.73/1.71  #Fact    : 0
% 2.73/1.71  #Define  : 0
% 2.73/1.71  #Split   : 1
% 2.73/1.71  #Chain   : 0
% 2.73/1.71  #Close   : 0
% 2.73/1.71  
% 2.73/1.71  Ordering : KBO
% 2.73/1.71  
% 2.73/1.71  Simplification rules
% 2.73/1.71  ----------------------
% 2.73/1.71  #Subsume      : 7
% 2.73/1.71  #Demod        : 2
% 2.73/1.71  #Tautology    : 0
% 2.73/1.71  #SimpNegUnit  : 11
% 2.73/1.71  #BackRed      : 2
% 2.73/1.71  
% 2.73/1.71  #Partial instantiations: 0
% 2.73/1.71  #Strategies tried      : 1
% 2.73/1.71  
% 2.73/1.71  Timing (in seconds)
% 2.73/1.71  ----------------------
% 2.73/1.71  Preprocessing        : 0.46
% 2.73/1.71  Parsing              : 0.25
% 2.73/1.71  CNF conversion       : 0.03
% 2.73/1.71  Main loop            : 0.18
% 2.73/1.72  Inferencing          : 0.06
% 2.73/1.72  Reduction            : 0.05
% 2.73/1.72  Demodulation         : 0.03
% 2.73/1.72  BG Simplification    : 0.01
% 2.73/1.72  Subsumption          : 0.04
% 2.73/1.72  Abstraction          : 0.01
% 2.73/1.72  MUC search           : 0.00
% 2.73/1.72  Cooper               : 0.00
% 2.73/1.72  Total                : 0.69
% 2.73/1.72  Index Insertion      : 0.00
% 2.73/1.72  Index Deletion       : 0.00
% 2.73/1.72  Index Matching       : 0.00
% 2.73/1.72  BG Taut test         : 0.00
%------------------------------------------------------------------------------