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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Beagle---0.9.51
% Problem  : LCL068-1 : TPTP v8.1.2. Bugfixed v1.2.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 : n013.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:47:17 EDT 2023

% Result   : Unsatisfiable 10.06s 3.55s
% Output   : CNFRefutation 10.06s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :    9
% Syntax   : Number of formulae    :   53 (  26 unt;   4 typ;   0 def)
%            Number of atoms       :   84 (   0 equ)
%            Maximal formula atoms :    4 (   1 avg)
%            Number of connectives :   76 (  41   ~;  35   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   4 avg)
%            Maximal term depth    :    5 (   2 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :    4 (   3   >;   1   *;   0   +;   0  <<)
%            Number of predicates  :    2 (   1 usr;   1 prp; 0-1 aty)
%            Number of functors    :    3 (   3 usr;   1 con; 0-2 aty)
%            Number of variables   :  109 (; 109   !;   0   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
%$ is_a_theorem > implies > #nlpp > not > a

%Foreground sorts:

%Background operators:

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

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

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

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

tff(f_41,axiom,
    ! [X,Y,Z] : is_a_theorem(implies(implies(implies(X,Y),Z),implies(not(X),Z))),
    file(unknown,unknown) ).

tff(f_37,axiom,
    ! [X,Y] :
      ( ~ is_a_theorem(implies(X,Y))
      | ~ is_a_theorem(X)
      | is_a_theorem(Y) ),
    file(unknown,unknown) ).

tff(f_39,axiom,
    ! [X,Y,Z] : is_a_theorem(implies(implies(implies(X,Y),Z),implies(Y,Z))),
    file(unknown,unknown) ).

tff(f_43,axiom,
    ! [X,Z,Y] : is_a_theorem(implies(implies(not(X),Z),implies(implies(Y,Z),implies(implies(X,Y),Z)))),
    file(unknown,unknown) ).

tff(f_45,axiom,
    ~ is_a_theorem(implies(implies(not(a),a),a)),
    file(unknown,unknown) ).

tff(c_6,plain,
    ! [X_6,Y_7,Z_8] : is_a_theorem(implies(implies(implies(X_6,Y_7),Z_8),implies(not(X_6),Z_8))),
    inference(cnfTransformation,[status(thm)],[f_41]) ).

tff(c_32,plain,
    ! [X_22,Y_23,Z_24] : is_a_theorem(implies(implies(implies(X_22,Y_23),Z_24),implies(not(X_22),Z_24))),
    inference(cnfTransformation,[status(thm)],[f_41]) ).

tff(c_2,plain,
    ! [Y_2,X_1] :
      ( is_a_theorem(Y_2)
      | ~ is_a_theorem(X_1)
      | ~ is_a_theorem(implies(X_1,Y_2)) ),
    inference(cnfTransformation,[status(thm)],[f_37]) ).

tff(c_106,plain,
    ! [X_44,Z_45,Y_46] :
      ( is_a_theorem(implies(not(X_44),Z_45))
      | ~ is_a_theorem(implies(implies(X_44,Y_46),Z_45)) ),
    inference(resolution,[status(thm)],[c_32,c_2]) ).

tff(c_146,plain,
    ! [X_6,Y_7,Z_8] : is_a_theorem(implies(not(implies(X_6,Y_7)),implies(not(X_6),Z_8))),
    inference(resolution,[status(thm)],[c_6,c_106]) ).

tff(c_4,plain,
    ! [X_3,Y_4,Z_5] : is_a_theorem(implies(implies(implies(X_3,Y_4),Z_5),implies(Y_4,Z_5))),
    inference(cnfTransformation,[status(thm)],[f_39]) ).

tff(c_12,plain,
    ! [X_14,Y_15,Z_16] : is_a_theorem(implies(implies(implies(X_14,Y_15),Z_16),implies(Y_15,Z_16))),
    inference(cnfTransformation,[status(thm)],[f_39]) ).

tff(c_17,plain,
    ! [Y_17,Z_18,X_19] :
      ( is_a_theorem(implies(Y_17,Z_18))
      | ~ is_a_theorem(implies(implies(X_19,Y_17),Z_18)) ),
    inference(resolution,[status(thm)],[c_12,c_2]) ).

tff(c_21,plain,
    ! [Z_5,Y_4] : is_a_theorem(implies(Z_5,implies(Y_4,Z_5))),
    inference(resolution,[status(thm)],[c_4,c_17]) ).

tff(c_66,plain,
    ! [X_30,Z_31,Y_32] : is_a_theorem(implies(implies(not(X_30),Z_31),implies(implies(Y_32,Z_31),implies(implies(X_30,Y_32),Z_31)))),
    inference(cnfTransformation,[status(thm)],[f_43]) ).

tff(c_154,plain,
    ! [Y_50,Z_51,X_52] :
      ( is_a_theorem(implies(implies(Y_50,Z_51),implies(implies(X_52,Y_50),Z_51)))
      | ~ is_a_theorem(implies(not(X_52),Z_51)) ),
    inference(resolution,[status(thm)],[c_66,c_2]) ).

tff(c_13111,plain,
    ! [X_613,Y_614,Z_615] :
      ( is_a_theorem(implies(implies(X_613,Y_614),Z_615))
      | ~ is_a_theorem(implies(Y_614,Z_615))
      | ~ is_a_theorem(implies(not(X_613),Z_615)) ),
    inference(resolution,[status(thm)],[c_154,c_2]) ).

tff(c_13270,plain,
    ! [Z_627,X_628,Y_629] :
      ( is_a_theorem(Z_627)
      | ~ is_a_theorem(implies(X_628,Y_629))
      | ~ is_a_theorem(implies(Y_629,Z_627))
      | ~ is_a_theorem(implies(not(X_628),Z_627)) ),
    inference(resolution,[status(thm)],[c_13111,c_2]) ).

tff(c_13366,plain,
    ! [Z_644,Y_645,Z_646] :
      ( is_a_theorem(Z_644)
      | ~ is_a_theorem(implies(implies(Y_645,Z_646),Z_644))
      | ~ is_a_theorem(implies(not(Z_646),Z_644)) ),
    inference(resolution,[status(thm)],[c_21,c_13270]) ).

tff(c_13460,plain,
    ! [Y_649,Z_650] :
      ( is_a_theorem(implies(Y_649,Z_650))
      | ~ is_a_theorem(implies(not(Z_650),implies(Y_649,Z_650))) ),
    inference(resolution,[status(thm)],[c_4,c_13366]) ).

tff(c_13520,plain,
    ! [X_651,Y_652] : is_a_theorem(implies(not(X_651),implies(X_651,Y_652))),
    inference(resolution,[status(thm)],[c_146,c_13460]) ).

tff(c_13458,plain,
    ! [Y_4,Z_5] :
      ( is_a_theorem(implies(Y_4,Z_5))
      | ~ is_a_theorem(implies(not(Z_5),implies(Y_4,Z_5))) ),
    inference(resolution,[status(thm)],[c_4,c_13366]) ).

tff(c_13532,plain,
    ! [Y_652] : is_a_theorem(implies(Y_652,Y_652)),
    inference(resolution,[status(thm)],[c_13520,c_13458]) ).

tff(c_22,plain,
    ! [Z_20,Y_21] : is_a_theorem(implies(Z_20,implies(Y_21,Z_20))),
    inference(resolution,[status(thm)],[c_4,c_17]) ).

tff(c_16,plain,
    ! [Y_15,Z_16,X_14] :
      ( is_a_theorem(implies(Y_15,Z_16))
      | ~ is_a_theorem(implies(implies(X_14,Y_15),Z_16)) ),
    inference(resolution,[status(thm)],[c_12,c_2]) ).

tff(c_30,plain,
    ! [Y_15,Y_21,X_14] : is_a_theorem(implies(Y_15,implies(Y_21,implies(X_14,Y_15)))),
    inference(resolution,[status(thm)],[c_22,c_16]) ).

tff(c_144,plain,
    ! [X_44,Y_21,X_14,Y_46] : is_a_theorem(implies(not(X_44),implies(Y_21,implies(X_14,implies(X_44,Y_46))))),
    inference(resolution,[status(thm)],[c_30,c_106]) ).

tff(c_147,plain,
    ! [X_44,Y_4,Y_46] : is_a_theorem(implies(not(X_44),implies(Y_4,implies(X_44,Y_46)))),
    inference(resolution,[status(thm)],[c_21,c_106]) ).

tff(c_461,plain,
    ! [X_119,Y_120,Z_121] :
      ( is_a_theorem(implies(implies(X_119,Y_120),Z_121))
      | ~ is_a_theorem(implies(Y_120,Z_121))
      | ~ is_a_theorem(implies(not(X_119),Z_121)) ),
    inference(resolution,[status(thm)],[c_154,c_2]) ).

tff(c_489,plain,
    ! [Z_136,X_137,Y_138] :
      ( is_a_theorem(Z_136)
      | ~ is_a_theorem(implies(X_137,Y_138))
      | ~ is_a_theorem(implies(Y_138,Z_136))
      | ~ is_a_theorem(implies(not(X_137),Z_136)) ),
    inference(resolution,[status(thm)],[c_461,c_2]) ).

tff(c_2395,plain,
    ! [Z_219,Y_220,X_221,Y_222] :
      ( is_a_theorem(Z_219)
      | ~ is_a_theorem(implies(implies(Y_220,implies(X_221,Y_222)),Z_219))
      | ~ is_a_theorem(implies(not(not(X_221)),Z_219)) ),
    inference(resolution,[status(thm)],[c_147,c_489]) ).

tff(c_12395,plain,
    ! [Y_603,X_604,Y_605] :
      ( is_a_theorem(implies(Y_603,implies(X_604,Y_605)))
      | ~ is_a_theorem(implies(not(not(X_604)),implies(Y_603,implies(X_604,Y_605)))) ),
    inference(resolution,[status(thm)],[c_4,c_2395]) ).

tff(c_12753,plain,
    ! [Y_608,X_609,Y_610] : is_a_theorem(implies(Y_608,implies(X_609,implies(not(X_609),Y_610)))),
    inference(resolution,[status(thm)],[c_144,c_12395]) ).

tff(c_2520,plain,
    ! [Y_4,X_221,Y_222] :
      ( is_a_theorem(implies(Y_4,implies(X_221,Y_222)))
      | ~ is_a_theorem(implies(not(not(X_221)),implies(Y_4,implies(X_221,Y_222)))) ),
    inference(resolution,[status(thm)],[c_4,c_2395]) ).

tff(c_12956,plain,
    ! [X_611,Y_612] : is_a_theorem(implies(X_611,implies(not(X_611),Y_612))),
    inference(resolution,[status(thm)],[c_12753,c_2520]) ).

tff(c_748,plain,
    ! [Z_153,Y_154,Z_155] :
      ( is_a_theorem(Z_153)
      | ~ is_a_theorem(implies(implies(Y_154,Z_155),Z_153))
      | ~ is_a_theorem(implies(not(Z_155),Z_153)) ),
    inference(resolution,[status(thm)],[c_21,c_489]) ).

tff(c_840,plain,
    ! [Y_4,Z_5] :
      ( is_a_theorem(implies(Y_4,Z_5))
      | ~ is_a_theorem(implies(not(Z_5),implies(Y_4,Z_5))) ),
    inference(resolution,[status(thm)],[c_4,c_748]) ).

tff(c_13099,plain,
    ! [Y_612] : is_a_theorem(implies(not(not(Y_612)),Y_612)),
    inference(resolution,[status(thm)],[c_12956,c_840]) ).

tff(c_41,plain,
    ! [X_22,Z_24,Y_23] :
      ( is_a_theorem(implies(not(X_22),Z_24))
      | ~ is_a_theorem(implies(implies(X_22,Y_23),Z_24)) ),
    inference(resolution,[status(thm)],[c_32,c_2]) ).

tff(c_306,plain,
    ! [Y_99,X_100,Z_101] :
      ( is_a_theorem(implies(not(Y_99),implies(implies(X_100,Y_99),Z_101)))
      | ~ is_a_theorem(implies(not(X_100),Z_101)) ),
    inference(resolution,[status(thm)],[c_154,c_41]) ).

tff(c_316,plain,
    ! [X_105,Y_106,Z_107] :
      ( is_a_theorem(implies(implies(X_105,Y_106),Z_107))
      | ~ is_a_theorem(not(Y_106))
      | ~ is_a_theorem(implies(not(X_105),Z_107)) ),
    inference(resolution,[status(thm)],[c_306,c_2]) ).

tff(c_10,plain,
    ~ is_a_theorem(implies(implies(not(a),a),a)),
    inference(cnfTransformation,[status(thm)],[f_45]) ).

tff(c_332,plain,
    ( ~ is_a_theorem(not(a))
    | ~ is_a_theorem(implies(not(not(a)),a)) ),
    inference(resolution,[status(thm)],[c_316,c_10]) ).

tff(c_333,plain,
    ~ is_a_theorem(implies(not(not(a)),a)),
    inference(splitLeft,[status(thm)],[c_332]) ).

tff(c_13108,plain,
    $false,
    inference(demodulation,[status(thm),theory(equality)],[c_13099,c_333]) ).

tff(c_13110,plain,
    is_a_theorem(implies(not(not(a)),a)),
    inference(splitRight,[status(thm)],[c_332]) ).

tff(c_13127,plain,
    ( ~ is_a_theorem(implies(a,a))
    | ~ is_a_theorem(implies(not(not(a)),a)) ),
    inference(resolution,[status(thm)],[c_13111,c_10]) ).

tff(c_13135,plain,
    ~ is_a_theorem(implies(a,a)),
    inference(demodulation,[status(thm),theory(equality)],[c_13110,c_13127]) ).

tff(c_13538,plain,
    $false,
    inference(demodulation,[status(thm),theory(equality)],[c_13532,c_13135]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.14  % Problem  : LCL068-1 : TPTP v8.1.2. Bugfixed v1.2.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.15/0.36  % Computer : n013.cluster.edu
% 0.15/0.36  % Model    : x86_64 x86_64
% 0.15/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36  % Memory   : 8042.1875MB
% 0.15/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36  % CPULimit : 300
% 0.15/0.36  % WCLimit  : 300
% 0.15/0.36  % DateTime : Thu Aug  3 14:09:47 EDT 2023
% 0.15/0.37  % CPUTime  : 
% 10.06/3.55  % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 10.06/3.56  
% 10.06/3.56  % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 10.06/3.60  
% 10.06/3.60  Inference rules
% 10.06/3.60  ----------------------
% 10.06/3.60  #Ref     : 0
% 10.06/3.60  #Sup     : 2923
% 10.06/3.60  #Fact    : 0
% 10.06/3.60  #Define  : 0
% 10.06/3.60  #Split   : 17
% 10.06/3.60  #Chain   : 0
% 10.06/3.60  #Close   : 0
% 10.06/3.60  
% 10.06/3.60  Ordering : KBO
% 10.06/3.60  
% 10.06/3.60  Simplification rules
% 10.06/3.60  ----------------------
% 10.06/3.60  #Subsume      : 1512
% 10.06/3.60  #Demod        : 667
% 10.06/3.60  #Tautology    : 553
% 10.06/3.60  #SimpNegUnit  : 330
% 10.06/3.60  #BackRed      : 135
% 10.06/3.60  
% 10.34/3.60  #Partial instantiations: 0
% 10.34/3.60  #Strategies tried      : 1
% 10.34/3.60  
% 10.34/3.60  Timing (in seconds)
% 10.34/3.60  ----------------------
% 10.34/3.60  Preprocessing        : 0.39
% 10.34/3.60  Parsing              : 0.21
% 10.34/3.60  CNF conversion       : 0.02
% 10.34/3.60  Main loop            : 2.07
% 10.34/3.60  Inferencing          : 0.64
% 10.34/3.60  Reduction            : 0.57
% 10.34/3.60  Demodulation         : 0.42
% 10.34/3.60  BG Simplification    : 0.04
% 10.34/3.60  Subsumption          : 0.69
% 10.34/3.60  Abstraction          : 0.04
% 10.34/3.60  MUC search           : 0.00
% 10.34/3.60  Cooper               : 0.00
% 10.34/3.60  Total                : 2.52
% 10.34/3.60  Index Insertion      : 0.00
% 10.34/3.60  Index Deletion       : 0.00
% 10.34/3.60  Index Matching       : 0.00
% 10.34/3.60  BG Taut test         : 0.00
%------------------------------------------------------------------------------