TSTP Solution File: GEO039-2 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : GEO039-2 : 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/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:00 EDT 2023
% Result : Unsatisfiable 3.26s 1.79s
% Output : CNFRefutation 3.26s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 21
% Syntax : Number of formulae : 35 ( 17 unt; 14 typ; 0 def)
% Number of atoms : 25 ( 8 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 12 ( 8 ~; 4 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 32 ( 7 >; 25 *; 0 +; 0 <<)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-4 aty)
% Number of functors : 12 ( 12 usr; 7 con; 0-6 aty)
% Number of variables : 31 (; 31 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ equidistant > between > continuous > inner_pasch > euclid2 > euclid1 > extension > #nlpp > x > 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(x,type,
x: $i ).
tff(lower_dimension_point_2,type,
lower_dimension_point_2: $i ).
tff(w,type,
w: $i ).
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(euclid1,type,
euclid1: ( $i * $i * $i * $i * $i ) > $i ).
tff(between,type,
between: ( $i * $i * $i ) > $o ).
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_78,axiom,
! [Y,X,W,V] : equidistant(Y,extension(X,Y,W,V),W,V),
file(unknown,unknown) ).
tff(f_71,axiom,
! [X,Y,Z] :
( ~ equidistant(X,Y,Z,Z)
| ( X = Y ) ),
file(unknown,unknown) ).
tff(f_75,axiom,
! [X,Y,W,V] : between(X,Y,extension(X,Y,W,V)),
file(unknown,unknown) ).
tff(f_223,axiom,
u = x,
file(unknown,unknown) ).
tff(f_222,axiom,
between(u,w,x),
file(unknown,unknown) ).
tff(f_107,axiom,
! [X,Y] :
( ~ between(X,Y,X)
| ( X = Y ) ),
file(unknown,unknown) ).
tff(f_225,axiom,
~ between(v,w,x),
file(unknown,unknown) ).
tff(c_74,plain,
! [Y_83,X_84,W_85,V_86] : equidistant(Y_83,extension(X_84,Y_83,W_85,V_86),W_85,V_86),
inference(cnfTransformation,[status(thm)],[f_78]) ).
tff(c_6,plain,
! [Y_10,X_9,Z_11] :
( ( Y_10 = X_9 )
| ~ equidistant(X_9,Y_10,Z_11,Z_11) ),
inference(cnfTransformation,[status(thm)],[f_71]) ).
tff(c_80,plain,
! [X_87,Y_88,V_89] : ( extension(X_87,Y_88,V_89,V_89) = Y_88 ),
inference(resolution,[status(thm)],[c_74,c_6]) ).
tff(c_8,plain,
! [X_12,Y_13,W_14,V_15] : between(X_12,Y_13,extension(X_12,Y_13,W_14,V_15)),
inference(cnfTransformation,[status(thm)],[f_75]) ).
tff(c_89,plain,
! [X_87,Y_88] : between(X_87,Y_88,Y_88),
inference(superposition,[status(thm),theory(equality)],[c_80,c_8]) ).
tff(c_40,plain,
x = u,
inference(cnfTransformation,[status(thm)],[f_223]) ).
tff(c_38,plain,
between(u,w,x),
inference(cnfTransformation,[status(thm)],[f_222]) ).
tff(c_44,plain,
between(u,w,u),
inference(demodulation,[status(thm),theory(equality)],[c_40,c_38]) ).
tff(c_50,plain,
! [Y_74,X_75] :
( ( Y_74 = X_75 )
| ~ between(X_75,Y_74,X_75) ),
inference(cnfTransformation,[status(thm)],[f_107]) ).
tff(c_54,plain,
w = u,
inference(resolution,[status(thm)],[c_44,c_50]) ).
tff(c_42,plain,
~ between(v,w,x),
inference(cnfTransformation,[status(thm)],[f_225]) ).
tff(c_43,plain,
~ between(v,w,u),
inference(demodulation,[status(thm),theory(equality)],[c_40,c_42]) ).
tff(c_56,plain,
~ between(v,u,u),
inference(demodulation,[status(thm),theory(equality)],[c_54,c_43]) ).
tff(c_105,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_89,c_56]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : GEO039-2 : TPTP v8.1.2. Released v1.0.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.14/0.36 % Computer : n010.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.21/0.36 % WCLimit : 300
% 0.21/0.36 % DateTime : Fri Aug 4 00:20:58 EDT 2023
% 0.21/0.36 % CPUTime :
% 3.26/1.79 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.26/1.80
% 3.26/1.80 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 3.26/1.83
% 3.26/1.83 Inference rules
% 3.26/1.83 ----------------------
% 3.26/1.83 #Ref : 0
% 3.26/1.83 #Sup : 14
% 3.26/1.83 #Fact : 0
% 3.26/1.83 #Define : 0
% 3.26/1.83 #Split : 0
% 3.26/1.83 #Chain : 0
% 3.26/1.83 #Close : 0
% 3.26/1.83
% 3.26/1.83 Ordering : KBO
% 3.26/1.83
% 3.26/1.83 Simplification rules
% 3.26/1.83 ----------------------
% 3.26/1.83 #Subsume : 0
% 3.26/1.83 #Demod : 6
% 3.26/1.83 #Tautology : 9
% 3.26/1.83 #SimpNegUnit : 0
% 3.26/1.83 #BackRed : 3
% 3.26/1.83
% 3.26/1.83 #Partial instantiations: 0
% 3.26/1.83 #Strategies tried : 1
% 3.26/1.83
% 3.26/1.83 Timing (in seconds)
% 3.26/1.83 ----------------------
% 3.26/1.83 Preprocessing : 0.51
% 3.26/1.83 Parsing : 0.28
% 3.26/1.83 CNF conversion : 0.03
% 3.26/1.83 Main loop : 0.21
% 3.26/1.83 Inferencing : 0.07
% 3.26/1.83 Reduction : 0.06
% 3.26/1.83 Demodulation : 0.04
% 3.26/1.83 BG Simplification : 0.02
% 3.26/1.83 Subsumption : 0.04
% 3.26/1.83 Abstraction : 0.01
% 3.26/1.83 MUC search : 0.00
% 3.26/1.83 Cooper : 0.00
% 3.26/1.83 Total : 0.76
% 3.26/1.83 Index Insertion : 0.00
% 3.26/1.83 Index Deletion : 0.00
% 3.26/1.83 Index Matching : 0.00
% 3.26/1.83 BG Taut test : 0.00
%------------------------------------------------------------------------------