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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Beagle---0.9.51
% Problem  : SYN729-1 : TPTP v8.1.2. Released v2.5.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 : n027.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 11:11:45 EDT 2023

% Result   : Unsatisfiable 2.54s 1.57s
% Output   : CNFRefutation 2.62s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :   12
% Syntax   : Number of formulae    :   24 (   7 unt;   6 typ;   0 def)
%            Number of atoms       :   29 (   0 equ)
%            Maximal formula atoms :    2 (   1 avg)
%            Number of connectives :   29 (  18   ~;  11   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    4 (   3 avg)
%            Maximal term depth    :    4 (   2 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :    6 (   5   >;   1   *;   0   +;   0  <<)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    4 (   4 usr;   1 con; 0-1 aty)
%            Number of variables   :   10 (;  10   !;   0   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
%$ l > p > #nlpp > sk1 > h > g > sk2

%Foreground sorts:

%Background operators:

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

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

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

tff(g,type,
    g: $i > $i ).

tff(h,type,
    h: $i > $i ).

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

tff(f_42,axiom,
    p(sk2),
    file(unknown,unknown) ).

tff(f_31,axiom,
    ! [A] :
      ( p(sk1(A))
      | ~ p(A) ),
    file(unknown,unknown) ).

tff(f_41,axiom,
    ! [A] :
      ( p(h(A))
      | ~ p(A) ),
    file(unknown,unknown) ).

tff(f_36,axiom,
    ! [A] :
      ( p(g(A))
      | ~ p(A) ),
    file(unknown,unknown) ).

tff(f_26,axiom,
    ! [A] :
      ( l(A,g(h(sk1(A))))
      | ~ p(A) ),
    file(unknown,unknown) ).

tff(f_48,axiom,
    ! [A] :
      ( ~ p(A)
      | ~ l(sk2,A) ),
    file(unknown,unknown) ).

tff(c_10,plain,
    p(sk2),
    inference(cnfTransformation,[status(thm)],[f_42]) ).

tff(c_4,plain,
    ! [A_2] :
      ( ~ p(A_2)
      | p(sk1(A_2)) ),
    inference(cnfTransformation,[status(thm)],[f_31]) ).

tff(c_8,plain,
    ! [A_4] :
      ( ~ p(A_4)
      | p(h(A_4)) ),
    inference(cnfTransformation,[status(thm)],[f_41]) ).

tff(c_6,plain,
    ! [A_3] :
      ( ~ p(A_3)
      | p(g(A_3)) ),
    inference(cnfTransformation,[status(thm)],[f_36]) ).

tff(c_17,plain,
    ! [A_10] :
      ( ~ p(A_10)
      | l(A_10,g(h(sk1(A_10)))) ),
    inference(cnfTransformation,[status(thm)],[f_26]) ).

tff(c_12,plain,
    ! [A_5] :
      ( ~ l(sk2,A_5)
      | ~ p(A_5) ),
    inference(cnfTransformation,[status(thm)],[f_48]) ).

tff(c_21,plain,
    ( ~ p(g(h(sk1(sk2))))
    | ~ p(sk2) ),
    inference(resolution,[status(thm)],[c_17,c_12]) ).

tff(c_24,plain,
    ~ p(g(h(sk1(sk2)))),
    inference(demodulation,[status(thm),theory(equality)],[c_10,c_21]) ).

tff(c_28,plain,
    ~ p(h(sk1(sk2))),
    inference(resolution,[status(thm)],[c_6,c_24]) ).

tff(c_32,plain,
    ~ p(sk1(sk2)),
    inference(resolution,[status(thm)],[c_8,c_28]) ).

tff(c_35,plain,
    ~ p(sk2),
    inference(resolution,[status(thm)],[c_4,c_32]) ).

tff(c_39,plain,
    $false,
    inference(demodulation,[status(thm),theory(equality)],[c_10,c_35]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : SYN729-1 : TPTP v8.1.2. Released v2.5.0.
% 0.00/0.13  % 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.14/0.34  % Computer : n027.cluster.edu
% 0.14/0.34  % Model    : x86_64 x86_64
% 0.14/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34  % Memory   : 8042.1875MB
% 0.14/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34  % CPULimit : 300
% 0.14/0.34  % WCLimit  : 300
% 0.14/0.34  % DateTime : Thu Aug  3 17:50:53 EDT 2023
% 0.14/0.34  % CPUTime  : 
% 2.54/1.57  % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.54/1.58  
% 2.54/1.58  % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 2.62/1.60  
% 2.62/1.60  Inference rules
% 2.62/1.60  ----------------------
% 2.62/1.60  #Ref     : 0
% 2.62/1.60  #Sup     : 4
% 2.62/1.60  #Fact    : 0
% 2.62/1.60  #Define  : 0
% 2.62/1.60  #Split   : 0
% 2.62/1.60  #Chain   : 0
% 2.62/1.60  #Close   : 0
% 2.62/1.60  
% 2.62/1.60  Ordering : KBO
% 2.62/1.60  
% 2.62/1.60  Simplification rules
% 2.62/1.60  ----------------------
% 2.62/1.60  #Subsume      : 0
% 2.62/1.60  #Demod        : 2
% 2.62/1.60  #Tautology    : 0
% 2.62/1.60  #SimpNegUnit  : 0
% 2.62/1.60  #BackRed      : 0
% 2.62/1.60  
% 2.62/1.60  #Partial instantiations: 0
% 2.62/1.60  #Strategies tried      : 1
% 2.62/1.60  
% 2.62/1.60  Timing (in seconds)
% 2.62/1.60  ----------------------
% 2.62/1.61  Preprocessing        : 0.39
% 2.62/1.61  Parsing              : 0.21
% 2.62/1.61  CNF conversion       : 0.02
% 2.62/1.61  Main loop            : 0.16
% 2.62/1.61  Inferencing          : 0.08
% 2.62/1.61  Reduction            : 0.03
% 2.62/1.61  Demodulation         : 0.02
% 2.62/1.61  BG Simplification    : 0.01
% 2.62/1.61  Subsumption          : 0.03
% 2.62/1.61  Abstraction          : 0.00
% 2.62/1.61  MUC search           : 0.00
% 2.62/1.61  Cooper               : 0.00
% 2.62/1.61  Total                : 0.60
% 2.62/1.61  Index Insertion      : 0.00
% 2.62/1.61  Index Deletion       : 0.00
% 2.62/1.61  Index Matching       : 0.00
% 2.62/1.61  BG Taut test         : 0.00
%------------------------------------------------------------------------------