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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Beagle---0.9.51
% Problem  : LCL140-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/sandbox2/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox2/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s

% Computer : n002.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:28 EDT 2023

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

% Comments : 
%------------------------------------------------------------------------------
%$ implies > #nlpp > not > x > truth

%Foreground sorts:

%Background operators:

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

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

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

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

tff(f_47,axiom,
    ! [X] : ( implies(truth,X) = X ),
    file(unknown,unknown) ).

tff(f_53,axiom,
    ! [X,Y] : ( implies(implies(not(X),not(Y)),implies(Y,X)) = truth ),
    file(unknown,unknown) ).

tff(f_49,axiom,
    ! [X,Y,Z] : ( implies(implies(X,Y),implies(implies(Y,Z),implies(X,Z))) = truth ),
    file(unknown,unknown) ).

tff(f_51,axiom,
    ! [X,Y] : ( implies(implies(X,Y),Y) = implies(implies(Y,X),X) ),
    file(unknown,unknown) ).

tff(f_57,axiom,
    not(not(x)) != x,
    file(unknown,unknown) ).

tff(c_2,plain,
    ! [X_1] : ( implies(truth,X_1) = X_1 ),
    inference(cnfTransformation,[status(thm)],[f_47]) ).

tff(c_20,plain,
    ! [X_10,Y_11] : ( implies(implies(not(X_10),not(Y_11)),implies(Y_11,X_10)) = truth ),
    inference(cnfTransformation,[status(thm)],[f_53]) ).

tff(c_33,plain,
    ! [X_1] : ( implies(implies(not(X_1),not(truth)),X_1) = truth ),
    inference(superposition,[status(thm),theory(equality)],[c_2,c_20]) ).

tff(c_91,plain,
    ! [X_15,Y_16,Z_17] : ( implies(implies(X_15,Y_16),implies(implies(Y_16,Z_17),implies(X_15,Z_17))) = truth ),
    inference(cnfTransformation,[status(thm)],[f_49]) ).

tff(c_183,plain,
    ! [Y_16,X_1] : ( implies(implies(truth,Y_16),implies(implies(Y_16,X_1),X_1)) = truth ),
    inference(superposition,[status(thm),theory(equality)],[c_2,c_91]) ).

tff(c_327,plain,
    ! [Y_20,X_21] : ( implies(Y_20,implies(implies(Y_20,X_21),X_21)) = truth ),
    inference(demodulation,[status(thm),theory(equality)],[c_2,c_183]) ).

tff(c_358,plain,
    ! [X_21] : ( implies(implies(truth,X_21),X_21) = truth ),
    inference(superposition,[status(thm),theory(equality)],[c_327,c_2]) ).

tff(c_416,plain,
    ! [X_21] : ( implies(X_21,X_21) = truth ),
    inference(demodulation,[status(thm),theory(equality)],[c_2,c_358]) ).

tff(c_46,plain,
    ! [Y_13,X_14] : ( implies(implies(Y_13,X_14),X_14) = implies(implies(X_14,Y_13),Y_13) ),
    inference(cnfTransformation,[status(thm)],[f_51]) ).

tff(c_79,plain,
    ! [X_1] : ( implies(implies(X_1,truth),truth) = implies(X_1,X_1) ),
    inference(superposition,[status(thm),theory(equality)],[c_2,c_46]) ).

tff(c_480,plain,
    ! [X_23] : ( implies(implies(X_23,truth),truth) = truth ),
    inference(demodulation,[status(thm),theory(equality)],[c_416,c_79]) ).

tff(c_193,plain,
    ! [Y_16,X_1] : ( implies(Y_16,implies(implies(Y_16,X_1),X_1)) = truth ),
    inference(demodulation,[status(thm),theory(equality)],[c_2,c_183]) ).

tff(c_566,plain,
    ! [X_24] : ( implies(X_24,truth) = truth ),
    inference(superposition,[status(thm),theory(equality)],[c_480,c_193]) ).

tff(c_4,plain,
    ! [X_2,Y_3,Z_4] : ( implies(implies(X_2,Y_3),implies(implies(Y_3,Z_4),implies(X_2,Z_4))) = truth ),
    inference(cnfTransformation,[status(thm)],[f_49]) ).

tff(c_580,plain,
    ! [Z_4,X_24] : ( implies(truth,implies(implies(truth,Z_4),implies(X_24,Z_4))) = truth ),
    inference(superposition,[status(thm),theory(equality)],[c_566,c_4]) ).

tff(c_635,plain,
    ! [Z_4,X_24] : ( implies(Z_4,implies(X_24,Z_4)) = truth ),
    inference(demodulation,[status(thm),theory(equality)],[c_2,c_2,c_580]) ).

tff(c_8,plain,
    ! [X_7,Y_8] : ( implies(implies(not(X_7),not(Y_8)),implies(Y_8,X_7)) = truth ),
    inference(cnfTransformation,[status(thm)],[f_53]) ).

tff(c_167,plain,
    ! [X_15,X_7,Y_8] : ( implies(implies(X_15,implies(not(X_7),not(Y_8))),implies(truth,implies(X_15,implies(Y_8,X_7)))) = truth ),
    inference(superposition,[status(thm),theory(equality)],[c_8,c_91]) ).

tff(c_772,plain,
    ! [X_27,X_28,Y_29] : ( implies(implies(X_27,implies(not(X_28),not(Y_29))),implies(X_27,implies(Y_29,X_28))) = truth ),
    inference(demodulation,[status(thm),theory(equality)],[c_2,c_167]) ).

tff(c_929,plain,
    ! [Y_30,X_31] : ( implies(truth,implies(not(Y_30),implies(Y_30,X_31))) = truth ),
    inference(superposition,[status(thm),theory(equality)],[c_635,c_772]) ).

tff(c_946,plain,
    ! [Y_30,X_31] : ( implies(truth,implies(truth,implies(not(Y_30),implies(Y_30,X_31)))) = truth ),
    inference(superposition,[status(thm),theory(equality)],[c_929,c_193]) ).

tff(c_1037,plain,
    ! [Y_32,X_33] : ( implies(not(Y_32),implies(Y_32,X_33)) = truth ),
    inference(demodulation,[status(thm),theory(equality)],[c_2,c_2,c_946]) ).

tff(c_1144,plain,
    ! [X_34] : ( implies(not(truth),X_34) = truth ),
    inference(superposition,[status(thm),theory(equality)],[c_2,c_1037]) ).

tff(c_6,plain,
    ! [Y_6,X_5] : ( implies(implies(Y_6,X_5),X_5) = implies(implies(X_5,Y_6),Y_6) ),
    inference(cnfTransformation,[status(thm)],[f_51]) ).

tff(c_1200,plain,
    ! [X_34] : ( implies(implies(X_34,not(truth)),not(truth)) = implies(truth,X_34) ),
    inference(superposition,[status(thm),theory(equality)],[c_1144,c_6]) ).

tff(c_1261,plain,
    ! [X_35] : ( implies(implies(X_35,not(truth)),not(truth)) = X_35 ),
    inference(demodulation,[status(thm),theory(equality)],[c_2,c_1200]) ).

tff(c_1017,plain,
    ! [Y_30,X_31] : ( implies(not(Y_30),implies(Y_30,X_31)) = truth ),
    inference(demodulation,[status(thm),theory(equality)],[c_2,c_2,c_946]) ).

tff(c_1398,plain,
    ! [X_36] : ( implies(not(implies(X_36,not(truth))),X_36) = truth ),
    inference(superposition,[status(thm),theory(equality)],[c_1261,c_1017]) ).

tff(c_1896,plain,
    ! [Y_41] : ( implies(truth,implies(Y_41,implies(not(Y_41),not(truth)))) = truth ),
    inference(superposition,[status(thm),theory(equality)],[c_1398,c_8]) ).

tff(c_1919,plain,
    ! [Y_41] : ( implies(truth,implies(truth,implies(Y_41,implies(not(Y_41),not(truth))))) = truth ),
    inference(superposition,[status(thm),theory(equality)],[c_1896,c_193]) ).

tff(c_1999,plain,
    ! [Y_42] : ( implies(Y_42,implies(not(Y_42),not(truth))) = truth ),
    inference(demodulation,[status(thm),theory(equality)],[c_2,c_2,c_1919]) ).

tff(c_2047,plain,
    ! [Y_42] : ( implies(implies(implies(not(Y_42),not(truth)),Y_42),Y_42) = implies(truth,implies(not(Y_42),not(truth))) ),
    inference(superposition,[status(thm),theory(equality)],[c_1999,c_6]) ).

tff(c_2115,plain,
    ! [Y_43] : ( implies(not(Y_43),not(truth)) = Y_43 ),
    inference(demodulation,[status(thm),theory(equality)],[c_2,c_33,c_2,c_2047]) ).

tff(c_1246,plain,
    ! [X_34] : ( implies(implies(X_34,not(truth)),not(truth)) = X_34 ),
    inference(demodulation,[status(thm),theory(equality)],[c_2,c_1200]) ).

tff(c_2137,plain,
    ! [Y_43] : ( implies(Y_43,not(truth)) = not(Y_43) ),
    inference(superposition,[status(thm),theory(equality)],[c_2115,c_1246]) ).

tff(c_2225,plain,
    ! [X_34] : ( not(not(X_34)) = X_34 ),
    inference(demodulation,[status(thm),theory(equality)],[c_2137,c_2137,c_1246]) ).

tff(c_10,plain,
    not(not(x)) != x,
    inference(cnfTransformation,[status(thm)],[f_57]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13  % Problem  : LCL140-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/sandbox2/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox2/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s
% 0.13/0.36  % Computer : n002.cluster.edu
% 0.13/0.36  % Model    : x86_64 x86_64
% 0.13/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.36  % Memory   : 8042.1875MB
% 0.13/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.36  % CPULimit : 300
% 0.13/0.36  % WCLimit  : 300
% 0.13/0.36  % DateTime : Thu Aug  3 14:08:16 EDT 2023
% 0.13/0.36  % CPUTime  : 
% 3.70/2.00  % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.70/2.00  
% 3.70/2.00  % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 4.13/2.03  
% 4.13/2.03  Inference rules
% 4.13/2.03  ----------------------
% 4.13/2.03  #Ref     : 0
% 4.13/2.03  #Sup     : 571
% 4.13/2.03  #Fact    : 0
% 4.13/2.03  #Define  : 0
% 4.13/2.03  #Split   : 0
% 4.13/2.03  #Chain   : 0
% 4.13/2.03  #Close   : 0
% 4.13/2.03  
% 4.13/2.03  Ordering : KBO
% 4.13/2.03  
% 4.13/2.03  Simplification rules
% 4.13/2.03  ----------------------
% 4.13/2.03  #Subsume      : 1
% 4.13/2.03  #Demod        : 643
% 4.13/2.03  #Tautology    : 436
% 4.13/2.03  #SimpNegUnit  : 0
% 4.13/2.03  #BackRed      : 10
% 4.13/2.03  
% 4.13/2.03  #Partial instantiations: 0
% 4.13/2.03  #Strategies tried      : 1
% 4.13/2.03  
% 4.13/2.03  Timing (in seconds)
% 4.13/2.03  ----------------------
% 4.13/2.04  Preprocessing        : 0.39
% 4.13/2.04  Parsing              : 0.21
% 4.13/2.04  CNF conversion       : 0.02
% 4.13/2.04  Main loop            : 0.57
% 4.13/2.04  Inferencing          : 0.21
% 4.13/2.04  Reduction            : 0.21
% 4.13/2.04  Demodulation         : 0.17
% 4.13/2.04  BG Simplification    : 0.02
% 4.13/2.04  Subsumption          : 0.09
% 4.13/2.04  Abstraction          : 0.03
% 4.13/2.04  MUC search           : 0.00
% 4.13/2.04  Cooper               : 0.00
% 4.13/2.04  Total                : 1.02
% 4.13/2.04  Index Insertion      : 0.00
% 4.13/2.04  Index Deletion       : 0.00
% 4.13/2.04  Index Matching       : 0.00
% 4.13/2.04  BG Taut test         : 0.00
%------------------------------------------------------------------------------