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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Beagle---0.9.51
% Problem  : GEO065-3 : 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 : n010.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:38:05 EDT 2023

% Result   : Unsatisfiable 4.32s 2.19s
% Output   : CNFRefutation 4.93s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    3
%            Number of leaves      :   20
% Syntax   : Number of formulae    :   27 (   7 unt;  16 typ;   0 def)
%            Number of atoms       :   15 (   0 equ)
%            Maximal formula atoms :    2 (   1 avg)
%            Number of connectives :   11 (   7   ~;   4   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   3 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :   41 (  10   >;  31   *;   0   +;   0  <<)
%            Number of predicates  :    4 (   3 usr;   1 prp; 0-4 aty)
%            Number of functors    :   13 (  13 usr;   6 con; 0-6 aty)
%            Number of variables   :   12 (;  12   !;   0   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
%$ equidistant > colinear > between > continuous > inner_pasch > euclid2 > euclid1 > insertion > extension > reflection > #nlpp > w > v > u > lower_dimension_point_3 > lower_dimension_point_2 > lower_dimension_point_1

%Foreground sorts:

%Background operators:

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

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

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

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

tff(colinear,type,
    colinear: ( $i * $i * $i ) > $o ).

tff(equidistant,type,
    equidistant: ( $i * $i * $i * $i ) > $o ).

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

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

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

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

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

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

tff(between,type,
    between: ( $i * $i * $i ) > $o ).

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

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

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

tff(f_257,axiom,
    ! [Y,Z,X] :
      ( ~ between(Y,Z,X)
      | colinear(X,Y,Z) ),
    file(unknown,unknown) ).

tff(f_773,axiom,
    ~ colinear(u,v,w),
    file(unknown,unknown) ).

tff(f_771,axiom,
    between(u,w,v),
    file(unknown,unknown) ).

tff(f_459,axiom,
    ! [U,V,W] :
      ( ~ between(U,V,W)
      | between(W,V,U) ),
    file(unknown,unknown) ).

tff(c_323,plain,
    ! [X_354,Y_355,Z_356] :
      ( colinear(X_354,Y_355,Z_356)
      | ~ between(Y_355,Z_356,X_354) ),
    inference(cnfTransformation,[status(thm)],[f_257]) ).

tff(c_178,plain,
    ~ colinear(u,v,w),
    inference(cnfTransformation,[status(thm)],[f_773]) ).

tff(c_327,plain,
    ~ between(v,w,u),
    inference(resolution,[status(thm)],[c_323,c_178]) ).

tff(c_176,plain,
    between(u,w,v),
    inference(cnfTransformation,[status(thm)],[f_771]) ).

tff(c_328,plain,
    ! [W_357,V_358,U_359] :
      ( between(W_357,V_358,U_359)
      | ~ between(U_359,V_358,W_357) ),
    inference(cnfTransformation,[status(thm)],[f_459]) ).

tff(c_338,plain,
    between(v,w,u),
    inference(resolution,[status(thm)],[c_176,c_328]) ).

tff(c_350,plain,
    $false,
    inference(negUnitSimplification,[status(thm)],[c_327,c_338]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13  % Problem  : GEO065-3 : TPTP v8.1.2. Bugfixed v1.2.1.
% 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.14/0.35  % Computer : n010.cluster.edu
% 0.14/0.35  % Model    : x86_64 x86_64
% 0.14/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35  % Memory   : 8042.1875MB
% 0.14/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35  % CPULimit : 300
% 0.14/0.35  % WCLimit  : 300
% 0.14/0.35  % DateTime : Fri Aug  4 00:20:28 EDT 2023
% 0.14/0.35  % CPUTime  : 
% 4.32/2.19  % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 4.32/2.20  
% 4.32/2.20  % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 4.93/2.22  
% 4.93/2.22  Inference rules
% 4.93/2.22  ----------------------
% 4.93/2.22  #Ref     : 0
% 4.93/2.22  #Sup     : 33
% 4.93/2.22  #Fact    : 0
% 4.93/2.22  #Define  : 0
% 4.93/2.22  #Split   : 0
% 4.93/2.22  #Chain   : 0
% 4.93/2.22  #Close   : 0
% 4.93/2.22  
% 4.93/2.22  Ordering : KBO
% 4.93/2.22  
% 4.93/2.22  Simplification rules
% 4.93/2.22  ----------------------
% 4.93/2.22  #Subsume      : 2
% 4.93/2.22  #Demod        : 21
% 4.93/2.22  #Tautology    : 34
% 4.93/2.22  #SimpNegUnit  : 1
% 4.93/2.22  #BackRed      : 0
% 4.93/2.22  
% 4.93/2.22  #Partial instantiations: 0
% 4.93/2.22  #Strategies tried      : 1
% 4.93/2.22  
% 4.93/2.22  Timing (in seconds)
% 4.93/2.22  ----------------------
% 4.93/2.22  Preprocessing        : 0.70
% 4.93/2.22  Parsing              : 0.30
% 4.93/2.22  CNF conversion       : 0.05
% 4.93/2.22  Main loop            : 0.33
% 4.93/2.22  Inferencing          : 0.07
% 4.93/2.22  Reduction            : 0.12
% 4.93/2.22  Demodulation         : 0.08
% 4.93/2.22  BG Simplification    : 0.04
% 4.93/2.22  Subsumption          : 0.10
% 4.93/2.22  Abstraction          : 0.01
% 4.93/2.22  MUC search           : 0.00
% 4.93/2.22  Cooper               : 0.00
% 4.93/2.22  Total                : 1.07
% 4.93/2.23  Index Insertion      : 0.00
% 4.93/2.23  Index Deletion       : 0.00
% 4.93/2.23  Index Matching       : 0.00
% 4.93/2.23  BG Taut test         : 0.00
%------------------------------------------------------------------------------