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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Beagle---0.9.51
% Problem  : SYN041-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 : n018.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:09:05 EDT 2023

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

% Comments : 
%------------------------------------------------------------------------------
%$ #nlpp > q > p

%Foreground sorts:

%Background operators:

%Foreground operators:
tff(p,type,
    p: $o ).

tff(q,type,
    q: $o ).

tff(f_29,axiom,
    q,
    file(unknown,unknown) ).

tff(f_28,axiom,
    ~ q,
    file(unknown,unknown) ).

tff(c_6,plain,
    q,
    inference(cnfTransformation,[status(thm)],[f_29]) ).

tff(c_4,plain,
    ~ q,
    inference(cnfTransformation,[status(thm)],[f_28]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13  % Problem  : SYN041-1 : TPTP v8.1.2. Released v1.0.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.13/0.34  % Computer : n018.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit : 300
% 0.13/0.34  % WCLimit  : 300
% 0.13/0.35  % DateTime : Thu Aug  3 17:31:05 EDT 2023
% 0.13/0.35  % CPUTime  : 
% 1.97/1.42  % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 1.97/1.43  
% 1.97/1.43  % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 1.97/1.46  
% 1.97/1.46  Inference rules
% 1.97/1.46  ----------------------
% 1.97/1.46  #Ref     : 0
% 1.97/1.46  #Sup     : 0
% 1.97/1.46  #Fact    : 0
% 1.97/1.46  #Define  : 0
% 1.97/1.46  #Split   : 0
% 1.97/1.46  #Chain   : 0
% 1.97/1.46  #Close   : 0
% 1.97/1.46  
% 1.97/1.46  Ordering : KBO
% 1.97/1.46  
% 1.97/1.46  Simplification rules
% 1.97/1.46  ----------------------
% 1.97/1.46  #Subsume      : 3
% 1.97/1.46  #Demod        : 1
% 1.97/1.46  #Tautology    : 0
% 1.97/1.46  #SimpNegUnit  : 0
% 1.97/1.46  #BackRed      : 0
% 1.97/1.46  
% 1.97/1.46  #Partial instantiations: 0
% 1.97/1.46  #Strategies tried      : 1
% 1.97/1.46  
% 1.97/1.46  Timing (in seconds)
% 1.97/1.46  ----------------------
% 1.97/1.47  Preprocessing        : 0.33
% 1.97/1.47  Parsing              : 0.17
% 1.97/1.47  CNF conversion       : 0.01
% 1.97/1.47  Main loop            : 0.05
% 1.97/1.47  Inferencing          : 0.00
% 1.97/1.47  Reduction            : 0.02
% 1.97/1.47  Demodulation         : 0.02
% 1.97/1.47  BG Simplification    : 0.01
% 1.97/1.47  Subsumption          : 0.02
% 1.97/1.47  Abstraction          : 0.00
% 1.97/1.47  MUC search           : 0.00
% 1.97/1.47  Cooper               : 0.00
% 1.97/1.47  Total                : 0.44
% 1.97/1.47  Index Insertion      : 0.00
% 1.97/1.47  Index Deletion       : 0.00
% 1.97/1.47  Index Matching       : 0.00
% 1.97/1.47  BG Taut test         : 0.00
%------------------------------------------------------------------------------