TSTP Solution File: SYN097-1.002 by Beagle---0.9.51

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Beagle---0.9.51
% Problem  : SYN097-1.002 : TPTP v8.1.2. Bugfixed v1.2.1.
% 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 : n028.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:36 EDT 2023

% Result   : Unsatisfiable 3.52s 1.85s
% Output   : CNFRefutation 3.62s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :   46
% Syntax   : Number of formulae    :   68 (  14 unt;  38 typ;   0 def)
%            Number of atoms       :   51 (   0 equ)
%            Maximal formula atoms :    4 (   1 avg)
%            Number of connectives :   45 (  24   ~;  21   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    5 (   2 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  :   39 (  38 usr;  39 prp; 0-0 aty)
%            Number of functors    :    0 (   0 usr;   0 con; --- aty)
%            Number of variables   :    0 (;   0   !;   0   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
%$ #nlpp > u_9 > u_8 > u_7 > u_6 > u_5 > u_4 > u_3 > u_2 > u_13 > u_12 > u_11 > u_10 > u_1 > sym_u_9 > sym_u_8 > sym_u_7 > sym_u_6 > sym_u_5 > sym_u_4 > sym_u_3 > sym_u_2 > sym_u_13 > sym_u_12 > sym_u_11 > sym_u_10 > sym_u_1 > sym_q_2_2 > sym_q_1_2 > sym_q_1_1 > sym_p_2_2 > sym_p_1_2 > sym_p_1_1 > q_2_2 > q_1_2 > q_1_1 > p_2_2 > p_1_2 > p_1_1

%Foreground sorts:

%Background operators:

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

tff(f_283,axiom,
    ( ~ sym_u_13
    | ~ sym_q_2_2 ),
    file(unknown,unknown) ).

tff(f_269,axiom,
    ( ~ sym_q_1_1
    | sym_u_11 ),
    file(unknown,unknown) ).

tff(f_155,axiom,
    sym_u_1,
    file(unknown,unknown) ).

tff(f_154,axiom,
    ( ~ sym_u_1
    | sym_p_1_2 ),
    file(unknown,unknown) ).

tff(f_181,axiom,
    ( ~ sym_p_1_2
    | sym_u_3 ),
    file(unknown,unknown) ).

tff(f_177,axiom,
    ( ~ sym_u_3
    | ~ sym_p_1_2
    | sym_q_2_2
    | sym_q_1_1 ),
    file(unknown,unknown) ).

tff(f_287,axiom,
    ( ~ sym_q_2_2
    | sym_u_13 ),
    file(unknown,unknown) ).

tff(f_265,axiom,
    ( ~ sym_u_11
    | ~ sym_q_1_1 ),
    file(unknown,unknown) ).

tff(c_102,plain,
    ( ~ sym_q_2_2
    | ~ sym_u_13 ),
    inference(cnfTransformation,[status(thm)],[f_283]) ).

tff(c_134,plain,
    ~ sym_u_13,
    inference(splitLeft,[status(thm)],[c_102]) ).

tff(c_96,plain,
    ( sym_u_11
    | ~ sym_q_1_1 ),
    inference(cnfTransformation,[status(thm)],[f_269]) ).

tff(c_129,plain,
    ~ sym_q_1_1,
    inference(splitLeft,[status(thm)],[c_96]) ).

tff(c_56,plain,
    sym_u_1,
    inference(cnfTransformation,[status(thm)],[f_155]) ).

tff(c_54,plain,
    ( sym_p_1_2
    | ~ sym_u_1 ),
    inference(cnfTransformation,[status(thm)],[f_154]) ).

tff(c_106,plain,
    sym_p_1_2,
    inference(demodulation,[status(thm),theory(equality)],[c_56,c_54]) ).

tff(c_64,plain,
    ( sym_u_3
    | ~ sym_p_1_2 ),
    inference(cnfTransformation,[status(thm)],[f_181]) ).

tff(c_108,plain,
    sym_u_3,
    inference(demodulation,[status(thm),theory(equality)],[c_106,c_64]) ).

tff(c_62,plain,
    ( sym_q_1_1
    | sym_q_2_2
    | ~ sym_p_1_2
    | ~ sym_u_3 ),
    inference(cnfTransformation,[status(thm)],[f_177]) ).

tff(c_111,plain,
    ( sym_q_1_1
    | sym_q_2_2
    | ~ sym_u_3 ),
    inference(demodulation,[status(thm),theory(equality)],[c_106,c_62]) ).

tff(c_118,plain,
    ( sym_q_1_1
    | sym_q_2_2 ),
    inference(demodulation,[status(thm),theory(equality)],[c_108,c_111]) ).

tff(c_162,plain,
    sym_q_2_2,
    inference(negUnitSimplification,[status(thm)],[c_129,c_118]) ).

tff(c_104,plain,
    ( sym_u_13
    | ~ sym_q_2_2 ),
    inference(cnfTransformation,[status(thm)],[f_287]) ).

tff(c_166,plain,
    sym_u_13,
    inference(demodulation,[status(thm),theory(equality)],[c_162,c_104]) ).

tff(c_167,plain,
    $false,
    inference(negUnitSimplification,[status(thm)],[c_134,c_166]) ).

tff(c_168,plain,
    ~ sym_q_2_2,
    inference(splitRight,[status(thm)],[c_102]) ).

tff(c_227,plain,
    $false,
    inference(negUnitSimplification,[status(thm)],[c_168,c_129,c_118]) ).

tff(c_228,plain,
    sym_u_11,
    inference(splitRight,[status(thm)],[c_96]) ).

tff(c_229,plain,
    sym_q_1_1,
    inference(splitRight,[status(thm)],[c_96]) ).

tff(c_94,plain,
    ( ~ sym_q_1_1
    | ~ sym_u_11 ),
    inference(cnfTransformation,[status(thm)],[f_265]) ).

tff(c_231,plain,
    $false,
    inference(demodulation,[status(thm),theory(equality)],[c_228,c_229,c_94]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : SYN097-1.002 : TPTP v8.1.2. Bugfixed v1.2.1.
% 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.13/0.35  % Computer : n028.cluster.edu
% 0.13/0.35  % Model    : x86_64 x86_64
% 0.13/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35  % Memory   : 8042.1875MB
% 0.13/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35  % CPULimit : 300
% 0.13/0.35  % WCLimit  : 300
% 0.13/0.35  % DateTime : Thu Aug  3 17:50:39 EDT 2023
% 0.13/0.35  % CPUTime  : 
% 3.52/1.85  % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.52/1.86  
% 3.52/1.86  % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 3.62/1.90  
% 3.62/1.90  Inference rules
% 3.62/1.90  ----------------------
% 3.62/1.90  #Ref     : 0
% 3.62/1.90  #Sup     : 0
% 3.62/1.90  #Fact    : 0
% 3.62/1.90  #Define  : 0
% 3.62/1.90  #Split   : 34
% 3.62/1.90  #Chain   : 0
% 3.62/1.90  #Close   : 0
% 3.62/1.90  
% 3.62/1.90  Ordering : KBO
% 3.62/1.90  
% 3.62/1.90  Simplification rules
% 3.62/1.90  ----------------------
% 3.62/1.90  #Subsume      : 18
% 3.62/1.90  #Demod        : 33
% 3.62/1.90  #Tautology    : 2
% 3.62/1.90  #SimpNegUnit  : 26
% 3.62/1.90  #BackRed      : 0
% 3.62/1.90  
% 3.62/1.90  #Partial instantiations: 0
% 3.62/1.90  #Strategies tried      : 1
% 3.62/1.90  
% 3.62/1.90  Timing (in seconds)
% 3.62/1.90  ----------------------
% 3.62/1.90  Preprocessing        : 0.48
% 3.62/1.90  Parsing              : 0.26
% 3.62/1.90  CNF conversion       : 0.02
% 3.62/1.90  Main loop            : 0.30
% 3.62/1.90  Inferencing          : 0.07
% 3.62/1.90  Reduction            : 0.10
% 3.62/1.90  Demodulation         : 0.06
% 3.62/1.90  BG Simplification    : 0.03
% 3.62/1.90  Subsumption          : 0.06
% 3.62/1.90  Abstraction          : 0.01
% 3.62/1.90  MUC search           : 0.00
% 3.62/1.90  Cooper               : 0.00
% 3.62/1.90  Total                : 0.85
% 3.62/1.90  Index Insertion      : 0.00
% 3.62/1.90  Index Deletion       : 0.00
% 3.62/1.90  Index Matching       : 0.00
% 3.62/1.90  BG Taut test         : 0.00
%------------------------------------------------------------------------------