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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Beagle---0.9.51
% Problem  : LCL178-1 : TPTP v8.1.2. Released v1.1.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 : n001.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:33 EDT 2023

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

% Comments : 
%------------------------------------------------------------------------------
%$ theorem > axiom > or > #nlpp > not > 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(axiom,type,
    axiom: $i > $o ).

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

tff(f_53,axiom,
    ! [A] : axiom(or(not(or(A,A)),A)),
    file(unknown,unknown) ).

tff(f_55,axiom,
    ! [A,B] : axiom(or(not(A),or(B,A))),
    file(unknown,unknown) ).

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

tff(f_82,axiom,
    ! [X,Z,Y] :
      ( theorem(or(not(X),Z))
      | ~ axiom(or(not(X),Y))
      | ~ theorem(or(not(Y),Z)) ),
    file(unknown,unknown) ).

tff(f_57,axiom,
    ! [A,B] : axiom(or(not(or(A,B)),or(B,A))),
    file(unknown,unknown) ).

tff(f_74,axiom,
    ! [X,Y] :
      ( theorem(X)
      | ~ axiom(or(not(Y),X))
      | ~ theorem(Y) ),
    file(unknown,unknown) ).

tff(f_86,axiom,
    ~ theorem(or(not(p),not(not(p)))),
    file(unknown,unknown) ).

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

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

tff(c_12,plain,
    ! [X_12] :
      ( ~ axiom(X_12)
      | theorem(X_12) ),
    inference(cnfTransformation,[status(thm)],[f_66]) ).

tff(c_86,plain,
    ! [Y_37,Z_38,X_39] :
      ( ~ theorem(or(not(Y_37),Z_38))
      | ~ axiom(or(not(X_39),Y_37))
      | theorem(or(not(X_39),Z_38)) ),
    inference(cnfTransformation,[status(thm)],[f_82]) ).

tff(c_333,plain,
    ! [X_81,Y_82,Z_83] :
      ( ~ axiom(or(not(X_81),Y_82))
      | theorem(or(not(X_81),Z_83))
      | ~ axiom(or(not(Y_82),Z_83)) ),
    inference(resolution,[status(thm)],[c_12,c_86]) ).

tff(c_374,plain,
    ! [A_87,Z_88,B_89] :
      ( theorem(or(not(A_87),Z_88))
      | ~ axiom(or(not(or(B_89,A_87)),Z_88)) ),
    inference(resolution,[status(thm)],[c_4,c_333]) ).

tff(c_396,plain,
    ! [A_90] : theorem(or(not(A_90),A_90)),
    inference(resolution,[status(thm)],[c_2,c_374]) ).

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

tff(c_27,plain,
    ! [Y_24,X_25] :
      ( ~ theorem(Y_24)
      | ~ axiom(or(not(Y_24),X_25))
      | theorem(X_25) ),
    inference(cnfTransformation,[status(thm)],[f_74]) ).

tff(c_37,plain,
    ! [A_4,B_5] :
      ( ~ theorem(or(A_4,B_5))
      | theorem(or(B_5,A_4)) ),
    inference(resolution,[status(thm)],[c_6,c_27]) ).

tff(c_406,plain,
    ! [A_90] : theorem(or(A_90,not(A_90))),
    inference(resolution,[status(thm)],[c_396,c_37]) ).

tff(c_18,plain,
    ~ theorem(or(not(p),not(not(p)))),
    inference(cnfTransformation,[status(thm)],[f_86]) ).

tff(c_419,plain,
    $false,
    inference(demodulation,[status(thm),theory(equality)],[c_406,c_18]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13  % Problem  : LCL178-1 : TPTP v8.1.2. Released v1.1.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.35  % Computer : n001.cluster.edu
% 0.15/0.35  % Model    : x86_64 x86_64
% 0.15/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35  % Memory   : 8042.1875MB
% 0.15/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35  % CPULimit : 300
% 0.15/0.35  % WCLimit  : 300
% 0.15/0.35  % DateTime : Thu Aug  3 14:34:25 EDT 2023
% 0.15/0.35  % CPUTime  : 
% 3.10/1.84  % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.10/1.85  
% 3.10/1.85  % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 3.10/1.87  
% 3.10/1.87  Inference rules
% 3.10/1.87  ----------------------
% 3.10/1.87  #Ref     : 0
% 3.10/1.87  #Sup     : 93
% 3.10/1.87  #Fact    : 0
% 3.10/1.87  #Define  : 0
% 3.10/1.87  #Split   : 0
% 3.10/1.87  #Chain   : 0
% 3.10/1.87  #Close   : 0
% 3.10/1.87  
% 3.10/1.87  Ordering : KBO
% 3.10/1.87  
% 3.10/1.87  Simplification rules
% 3.10/1.87  ----------------------
% 3.10/1.87  #Subsume      : 31
% 3.10/1.87  #Demod        : 1
% 3.10/1.87  #Tautology    : 3
% 3.10/1.87  #SimpNegUnit  : 0
% 3.10/1.87  #BackRed      : 1
% 3.10/1.87  
% 3.10/1.87  #Partial instantiations: 0
% 3.10/1.87  #Strategies tried      : 1
% 3.10/1.87  
% 3.10/1.87  Timing (in seconds)
% 3.10/1.87  ----------------------
% 3.48/1.88  Preprocessing        : 0.43
% 3.48/1.88  Parsing              : 0.24
% 3.48/1.88  CNF conversion       : 0.02
% 3.48/1.88  Main loop            : 0.39
% 3.48/1.88  Inferencing          : 0.17
% 3.48/1.88  Reduction            : 0.09
% 3.48/1.88  Demodulation         : 0.06
% 3.48/1.88  BG Simplification    : 0.02
% 3.48/1.88  Subsumption          : 0.10
% 3.48/1.88  Abstraction          : 0.01
% 3.48/1.88  MUC search           : 0.00
% 3.48/1.88  Cooper               : 0.00
% 3.48/1.88  Total                : 0.87
% 3.48/1.88  Index Insertion      : 0.00
% 3.48/1.88  Index Deletion       : 0.00
% 3.48/1.88  Index Matching       : 0.00
% 3.48/1.88  BG Taut test         : 0.00
%------------------------------------------------------------------------------