TSTP Solution File: LCL296-3 by Beagle---0.9.51

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Beagle---0.9.51
% Problem  : LCL296-3 : TPTP v8.1.2. Released v2.3.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 : n012.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:53 EDT 2023

% Result   : Unsatisfiable 7.19s 2.85s
% Output   : CNFRefutation 7.44s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   17
%            Number of leaves      :   19
% Syntax   : Number of formulae    :   67 (  32 unt;   9 typ;   0 def)
%            Number of atoms       :   91 (   9 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   69 (  36   ~;  33   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   4 avg)
%            Maximal term depth    :    5 (   2 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :   11 (   7   >;   4   *;   0   +;   0  <<)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    7 (   7 usr;   2 con; 0-2 aty)
%            Number of variables   :  111 (; 111   !;   0   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
%$ theorem > axiom > or > implies > equivalent > and > #nlpp > not > q > p

%Foreground sorts:

%Background operators:

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

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

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

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

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

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

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

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

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

tff(f_48,axiom,
    ! [A,B] : axiom(implies(A,or(B,A))),
    file(unknown,unknown) ).

tff(f_61,axiom,
    ! [X] :
      ( theorem(X)
      | ~ axiom(X) ),
    file(unknown,unknown) ).

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

tff(f_52,axiom,
    ! [A,B,C] : axiom(implies(or(A,or(B,C)),or(B,or(A,C)))),
    file(unknown,unknown) ).

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

tff(f_50,axiom,
    ! [A,B] : axiom(implies(or(A,B),or(B,A))),
    file(unknown,unknown) ).

tff(f_46,axiom,
    ! [A] : axiom(implies(or(A,A),A)),
    file(unknown,unknown) ).

tff(f_119,axiom,
    ! [P,Q] : ( equivalent(P,Q) = and(implies(P,Q),implies(Q,P)) ),
    file(unknown,unknown) ).

tff(f_96,axiom,
    ! [P,Q] : ( and(P,Q) = not(or(not(P),not(Q))) ),
    file(unknown,unknown) ).

tff(f_123,axiom,
    ~ theorem(equivalent(implies(p,not(q)),or(not(p),not(q)))),
    file(unknown,unknown) ).

tff(c_4,plain,
    ! [A_2,B_3] : axiom(implies(A_2,or(B_3,A_2))),
    inference(cnfTransformation,[status(thm)],[f_48]) ).

tff(c_14,plain,
    ! [X_14] :
      ( ~ axiom(X_14)
      | theorem(X_14) ),
    inference(cnfTransformation,[status(thm)],[f_61]) ).

tff(c_12,plain,
    ! [X_12,Y_13] : ( or(not(X_12),Y_13) = implies(X_12,Y_13) ),
    inference(cnfTransformation,[status(thm)],[f_56]) ).

tff(c_230,plain,
    ! [A_60,B_61,C_62] : axiom(implies(or(A_60,or(B_61,C_62)),or(B_61,or(A_60,C_62)))),
    inference(cnfTransformation,[status(thm)],[f_52]) ).

tff(c_240,plain,
    ! [X_12,B_61,C_62] : axiom(implies(implies(X_12,or(B_61,C_62)),or(B_61,or(not(X_12),C_62)))),
    inference(superposition,[status(thm),theory(equality)],[c_12,c_230]) ).

tff(c_660,plain,
    ! [X_106,B_107,C_108] : axiom(implies(implies(X_106,or(B_107,C_108)),or(B_107,implies(X_106,C_108)))),
    inference(demodulation,[status(thm),theory(equality)],[c_12,c_240]) ).

tff(c_70,plain,
    ! [Y_33,X_34] :
      ( ~ theorem(Y_33)
      | ~ theorem(implies(Y_33,X_34))
      | theorem(X_34) ),
    inference(cnfTransformation,[status(thm)],[f_69]) ).

tff(c_74,plain,
    ! [Y_33,X_34] :
      ( ~ theorem(Y_33)
      | theorem(X_34)
      | ~ axiom(implies(Y_33,X_34)) ),
    inference(resolution,[status(thm)],[c_14,c_70]) ).

tff(c_678,plain,
    ! [X_106,B_107,C_108] :
      ( ~ theorem(implies(X_106,or(B_107,C_108)))
      | theorem(or(B_107,implies(X_106,C_108))) ),
    inference(resolution,[status(thm)],[c_660,c_74]) ).

tff(c_6,plain,
    ! [A_4,B_5] : axiom(implies(or(A_4,B_5),or(B_5,A_4))),
    inference(cnfTransformation,[status(thm)],[f_50]) ).

tff(c_93,plain,
    ! [Y_38,X_39] :
      ( ~ theorem(Y_38)
      | theorem(X_39)
      | ~ axiom(implies(Y_38,X_39)) ),
    inference(resolution,[status(thm)],[c_14,c_70]) ).

tff(c_113,plain,
    ! [A_2,B_3] :
      ( ~ theorem(A_2)
      | theorem(or(B_3,A_2)) ),
    inference(resolution,[status(thm)],[c_4,c_93]) ).

tff(c_236,plain,
    ! [A_60,X_12,Y_13] : axiom(implies(or(A_60,implies(X_12,Y_13)),or(not(X_12),or(A_60,Y_13)))),
    inference(superposition,[status(thm),theory(equality)],[c_12,c_230]) ).

tff(c_925,plain,
    ! [A_138,X_139,Y_140] : axiom(implies(or(A_138,implies(X_139,Y_140)),implies(X_139,or(A_138,Y_140)))),
    inference(demodulation,[status(thm),theory(equality)],[c_12,c_236]) ).

tff(c_1794,plain,
    ! [A_256,X_257,Y_258] :
      ( ~ theorem(or(A_256,implies(X_257,Y_258)))
      | theorem(implies(X_257,or(A_256,Y_258))) ),
    inference(resolution,[status(thm)],[c_925,c_74]) ).

tff(c_1850,plain,
    ! [X_261,B_262,Y_263] :
      ( theorem(implies(X_261,or(B_262,Y_263)))
      | ~ theorem(implies(X_261,Y_263)) ),
    inference(resolution,[status(thm)],[c_113,c_1794]) ).

tff(c_16,plain,
    ! [Y_16,X_15] :
      ( ~ theorem(Y_16)
      | ~ theorem(implies(Y_16,X_15))
      | theorem(X_15) ),
    inference(cnfTransformation,[status(thm)],[f_69]) ).

tff(c_1868,plain,
    ! [X_264,B_265,Y_266] :
      ( ~ theorem(X_264)
      | theorem(or(B_265,Y_266))
      | ~ theorem(implies(X_264,Y_266)) ),
    inference(resolution,[status(thm)],[c_1850,c_16]) ).

tff(c_2451,plain,
    ! [X_296,B_297,Y_298] :
      ( ~ theorem(X_296)
      | theorem(or(B_297,Y_298))
      | ~ axiom(implies(X_296,Y_298)) ),
    inference(resolution,[status(thm)],[c_14,c_1868]) ).

tff(c_2751,plain,
    ! [A_326,B_327,B_328] :
      ( ~ theorem(or(A_326,B_327))
      | theorem(or(B_328,or(B_327,A_326))) ),
    inference(resolution,[status(thm)],[c_6,c_2451]) ).

tff(c_248,plain,
    ! [A_60,B_61,C_62] :
      ( ~ theorem(or(A_60,or(B_61,C_62)))
      | theorem(or(B_61,or(A_60,C_62))) ),
    inference(resolution,[status(thm)],[c_230,c_74]) ).

tff(c_3425,plain,
    ! [B_370,B_371,A_372] :
      ( theorem(or(B_370,or(B_371,A_372)))
      | ~ theorem(or(A_372,B_370)) ),
    inference(resolution,[status(thm)],[c_2751,c_248]) ).

tff(c_2,plain,
    ! [A_1] : axiom(implies(or(A_1,A_1),A_1)),
    inference(cnfTransformation,[status(thm)],[f_46]) ).

tff(c_112,plain,
    ! [A_1] :
      ( ~ theorem(or(A_1,A_1))
      | theorem(A_1) ),
    inference(resolution,[status(thm)],[c_2,c_93]) ).

tff(c_3692,plain,
    ! [B_399,A_400] :
      ( theorem(or(B_399,A_400))
      | ~ theorem(or(A_400,or(B_399,A_400))) ),
    inference(resolution,[status(thm)],[c_3425,c_112]) ).

tff(c_3779,plain,
    ! [X_12,Y_13] :
      ( theorem(or(not(X_12),Y_13))
      | ~ theorem(or(Y_13,implies(X_12,Y_13))) ),
    inference(superposition,[status(thm),theory(equality)],[c_12,c_3692]) ).

tff(c_4014,plain,
    ! [X_418,Y_419] :
      ( theorem(implies(X_418,Y_419))
      | ~ theorem(or(Y_419,implies(X_418,Y_419))) ),
    inference(demodulation,[status(thm),theory(equality)],[c_12,c_3779]) ).

tff(c_4481,plain,
    ! [X_440,C_441] :
      ( theorem(implies(X_440,C_441))
      | ~ theorem(implies(X_440,or(C_441,C_441))) ),
    inference(resolution,[status(thm)],[c_678,c_4014]) ).

tff(c_4591,plain,
    ! [X_444,C_445] :
      ( theorem(implies(X_444,C_445))
      | ~ axiom(implies(X_444,or(C_445,C_445))) ),
    inference(resolution,[status(thm)],[c_14,c_4481]) ).

tff(c_4631,plain,
    ! [A_2] : theorem(implies(A_2,A_2)),
    inference(resolution,[status(thm)],[c_4,c_4591]) ).

tff(c_20,plain,
    ! [P_19,Q_20] : ( and(implies(P_19,Q_20),implies(Q_20,P_19)) = equivalent(P_19,Q_20) ),
    inference(cnfTransformation,[status(thm)],[f_119]) ).

tff(c_18,plain,
    ! [P_17,Q_18] : ( not(or(not(P_17),not(Q_18))) = and(P_17,Q_18) ),
    inference(cnfTransformation,[status(thm)],[f_96]) ).

tff(c_52,plain,
    ! [P_31,Q_32] : ( not(implies(P_31,not(Q_32))) = and(P_31,Q_32) ),
    inference(demodulation,[status(thm),theory(equality)],[c_12,c_18]) ).

tff(c_61,plain,
    ! [P_31,Q_32,Y_13] : ( implies(implies(P_31,not(Q_32)),Y_13) = or(and(P_31,Q_32),Y_13) ),
    inference(superposition,[status(thm),theory(equality)],[c_52,c_12]) ).

tff(c_28,plain,
    ! [X_25,Y_26] : ( or(not(X_25),Y_26) = implies(X_25,Y_26) ),
    inference(cnfTransformation,[status(thm)],[f_56]) ).

tff(c_35,plain,
    ! [X_25] : axiom(implies(implies(X_25,not(X_25)),not(X_25))),
    inference(superposition,[status(thm),theory(equality)],[c_28,c_2]) ).

tff(c_503,plain,
    ! [X_93] : axiom(or(and(X_93,X_93),not(X_93))),
    inference(demodulation,[status(thm),theory(equality)],[c_61,c_35]) ).

tff(c_45,plain,
    ! [A_29,B_30] : axiom(implies(or(A_29,B_30),or(B_30,A_29))),
    inference(cnfTransformation,[status(thm)],[f_50]) ).

tff(c_258,plain,
    ! [Y_64,X_65] : axiom(implies(or(Y_64,not(X_65)),implies(X_65,Y_64))),
    inference(superposition,[status(thm),theory(equality)],[c_12,c_45]) ).

tff(c_282,plain,
    ! [Y_68,X_69] :
      ( ~ theorem(or(Y_68,not(X_69)))
      | theorem(implies(X_69,Y_68)) ),
    inference(resolution,[status(thm)],[c_258,c_74]) ).

tff(c_309,plain,
    ! [X_69,Y_68] :
      ( theorem(implies(X_69,Y_68))
      | ~ axiom(or(Y_68,not(X_69))) ),
    inference(resolution,[status(thm)],[c_14,c_282]) ).

tff(c_515,plain,
    ! [X_94] : theorem(implies(X_94,and(X_94,X_94))),
    inference(resolution,[status(thm)],[c_503,c_309]) ).

tff(c_528,plain,
    ! [X_95] :
      ( ~ theorem(X_95)
      | theorem(and(X_95,X_95)) ),
    inference(resolution,[status(thm)],[c_515,c_16]) ).

tff(c_538,plain,
    ! [Q_20] :
      ( ~ theorem(implies(Q_20,Q_20))
      | theorem(equivalent(Q_20,Q_20)) ),
    inference(superposition,[status(thm),theory(equality)],[c_20,c_528]) ).

tff(c_4639,plain,
    ! [Q_20] : theorem(equivalent(Q_20,Q_20)),
    inference(demodulation,[status(thm),theory(equality)],[c_4631,c_538]) ).

tff(c_22,plain,
    ~ theorem(equivalent(implies(p,not(q)),or(not(p),not(q)))),
    inference(cnfTransformation,[status(thm)],[f_123]) ).

tff(c_23,plain,
    ~ theorem(equivalent(implies(p,not(q)),implies(p,not(q)))),
    inference(demodulation,[status(thm),theory(equality)],[c_12,c_22]) ).

tff(c_4687,plain,
    $false,
    inference(demodulation,[status(thm),theory(equality)],[c_4639,c_23]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13  % Problem  : LCL296-3 : TPTP v8.1.2. Released v2.3.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.15/0.36  % Computer : n012.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 13:21:52 EDT 2023
% 0.15/0.36  % CPUTime  : 
% 7.19/2.85  % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 7.19/2.85  
% 7.19/2.85  % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 7.44/2.89  
% 7.44/2.89  Inference rules
% 7.44/2.89  ----------------------
% 7.44/2.89  #Ref     : 0
% 7.44/2.89  #Sup     : 1116
% 7.44/2.89  #Fact    : 0
% 7.44/2.89  #Define  : 0
% 7.44/2.89  #Split   : 2
% 7.44/2.89  #Chain   : 0
% 7.44/2.89  #Close   : 0
% 7.44/2.89  
% 7.44/2.89  Ordering : KBO
% 7.44/2.89  
% 7.44/2.89  Simplification rules
% 7.44/2.89  ----------------------
% 7.44/2.89  #Subsume      : 424
% 7.44/2.89  #Demod        : 390
% 7.44/2.89  #Tautology    : 92
% 7.44/2.89  #SimpNegUnit  : 0
% 7.44/2.89  #BackRed      : 6
% 7.44/2.89  
% 7.44/2.89  #Partial instantiations: 0
% 7.44/2.89  #Strategies tried      : 1
% 7.44/2.89  
% 7.44/2.89  Timing (in seconds)
% 7.44/2.89  ----------------------
% 7.44/2.89  Preprocessing        : 0.45
% 7.44/2.89  Parsing              : 0.24
% 7.44/2.89  CNF conversion       : 0.02
% 7.44/2.89  Main loop            : 1.28
% 7.44/2.89  Inferencing          : 0.47
% 7.44/2.89  Reduction            : 0.38
% 7.44/2.89  Demodulation         : 0.27
% 7.44/2.89  BG Simplification    : 0.03
% 7.44/2.89  Subsumption          : 0.31
% 7.44/2.89  Abstraction          : 0.03
% 7.44/2.89  MUC search           : 0.00
% 7.44/2.89  Cooper               : 0.00
% 7.44/2.89  Total                : 1.78
% 7.44/2.89  Index Insertion      : 0.00
% 7.44/2.89  Index Deletion       : 0.00
% 7.44/2.89  Index Matching       : 0.00
% 7.44/2.89  BG Taut test         : 0.00
%------------------------------------------------------------------------------