TSTP Solution File: GEO030-2 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : GEO030-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 : n023.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:37:58 EDT 2023
% Result : Unsatisfiable 10.26s 3.56s
% Output : CNFRefutation 10.58s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 23
% Syntax : Number of formulae : 48 ( 19 unt; 14 typ; 0 def)
% Number of atoms : 76 ( 14 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 83 ( 41 ~; 42 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 5 avg)
% Maximal term depth : 1 ( 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 : 60 (; 60 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ equidistant > between > continuous > inner_pasch > euclid2 > euclid1 > extension > #nlpp > w1 > 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(w1,type,
w1: $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(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_228,axiom,
w != w1,
file(unknown,unknown) ).
tff(f_56,axiom,
! [X,Y] : equidistant(X,Y,Y,X),
file(unknown,unknown) ).
tff(f_223,axiom,
equidistant(u,w,u,w1),
file(unknown,unknown) ).
tff(f_65,axiom,
! [W,Z,X,Y,V,V2] :
( ~ equidistant(X,Y,Z,V)
| ~ equidistant(X,Y,V2,W)
| equidistant(Z,V,V2,W) ),
file(unknown,unknown) ).
tff(f_224,axiom,
equidistant(v,w,v,w1),
file(unknown,unknown) ).
tff(f_226,axiom,
u != v,
file(unknown,unknown) ).
tff(f_222,axiom,
between(u,v,w),
file(unknown,unknown) ).
tff(f_101,axiom,
! [Y1,Z,X1,V1,X,Y,V,Z1] :
( ~ equidistant(X,Y,X1,Y1)
| ~ equidistant(Y,Z,Y1,Z1)
| ~ equidistant(X,V,X1,V1)
| ~ equidistant(Y,V,Y1,V1)
| ~ between(X,Y,Z)
| ~ between(X1,Y1,Z1)
| ( X = Y )
| equidistant(Z,V,Z1,V1) ),
file(unknown,unknown) ).
tff(f_71,axiom,
! [X,Y,Z] :
( ~ equidistant(X,Y,Z,Z)
| ( X = Y ) ),
file(unknown,unknown) ).
tff(c_46,plain,
w1 != w,
inference(cnfTransformation,[status(thm)],[f_228]) ).
tff(c_2,plain,
! [X_1,Y_2] : equidistant(X_1,Y_2,Y_2,X_1),
inference(cnfTransformation,[status(thm)],[f_56]) ).
tff(c_40,plain,
equidistant(u,w,u,w1),
inference(cnfTransformation,[status(thm)],[f_223]) ).
tff(c_85,plain,
! [X_97,W_96,V2_93,Y_95,Z_94,V_92] :
( equidistant(Z_94,V_92,V2_93,W_96)
| ~ equidistant(X_97,Y_95,V2_93,W_96)
| ~ equidistant(X_97,Y_95,Z_94,V_92) ),
inference(cnfTransformation,[status(thm)],[f_65]) ).
tff(c_127,plain,
! [Z_107,V_108] :
( equidistant(Z_107,V_108,u,w1)
| ~ equidistant(u,w,Z_107,V_108) ),
inference(resolution,[status(thm)],[c_40,c_85]) ).
tff(c_134,plain,
equidistant(w,u,u,w1),
inference(resolution,[status(thm)],[c_2,c_127]) ).
tff(c_141,plain,
! [Z_109,V_110,Y_111,X_112] :
( equidistant(Z_109,V_110,Y_111,X_112)
| ~ equidistant(X_112,Y_111,Z_109,V_110) ),
inference(resolution,[status(thm)],[c_2,c_85]) ).
tff(c_160,plain,
equidistant(u,w1,u,w),
inference(resolution,[status(thm)],[c_134,c_141]) ).
tff(c_42,plain,
equidistant(v,w,v,w1),
inference(cnfTransformation,[status(thm)],[f_224]) ).
tff(c_107,plain,
! [Z_100,V_101] :
( equidistant(Z_100,V_101,v,w1)
| ~ equidistant(v,w,Z_100,V_101) ),
inference(resolution,[status(thm)],[c_42,c_85]) ).
tff(c_114,plain,
equidistant(w,v,v,w1),
inference(resolution,[status(thm)],[c_2,c_107]) ).
tff(c_163,plain,
equidistant(v,w1,v,w),
inference(resolution,[status(thm)],[c_114,c_141]) ).
tff(c_44,plain,
v != u,
inference(cnfTransformation,[status(thm)],[f_226]) ).
tff(c_171,plain,
! [Y_2,X_1] : equidistant(Y_2,X_1,Y_2,X_1),
inference(resolution,[status(thm)],[c_2,c_141]) ).
tff(c_38,plain,
between(u,v,w),
inference(cnfTransformation,[status(thm)],[f_222]) ).
tff(c_575,plain,
! [Y_193,X_191,X1_190,Z_187,Z1_186,V1_192,Y1_189,V_188] :
( equidistant(Z_187,V_188,Z1_186,V1_192)
| ( Y_193 = X_191 )
| ~ between(X1_190,Y1_189,Z1_186)
| ~ between(X_191,Y_193,Z_187)
| ~ equidistant(Y_193,V_188,Y1_189,V1_192)
| ~ equidistant(X_191,V_188,X1_190,V1_192)
| ~ equidistant(Y_193,Z_187,Y1_189,Z1_186)
| ~ equidistant(X_191,Y_193,X1_190,Y1_189) ),
inference(cnfTransformation,[status(thm)],[f_101]) ).
tff(c_2321,plain,
! [Z_365,X_363,V_366,Y_364,V1_362] :
( equidistant(Z_365,V_366,w,V1_362)
| ( Y_364 = X_363 )
| ~ between(X_363,Y_364,Z_365)
| ~ equidistant(Y_364,V_366,v,V1_362)
| ~ equidistant(X_363,V_366,u,V1_362)
| ~ equidistant(Y_364,Z_365,v,w)
| ~ equidistant(X_363,Y_364,u,v) ),
inference(resolution,[status(thm)],[c_38,c_575]) ).
tff(c_2343,plain,
! [V_366,V1_362] :
( equidistant(w,V_366,w,V1_362)
| ( v = u )
| ~ equidistant(v,V_366,v,V1_362)
| ~ equidistant(u,V_366,u,V1_362)
| ~ equidistant(v,w,v,w)
| ~ equidistant(u,v,u,v) ),
inference(resolution,[status(thm)],[c_38,c_2321]) ).
tff(c_2356,plain,
! [V_366,V1_362] :
( equidistant(w,V_366,w,V1_362)
| ( v = u )
| ~ equidistant(v,V_366,v,V1_362)
| ~ equidistant(u,V_366,u,V1_362) ),
inference(demodulation,[status(thm),theory(equality)],[c_171,c_171,c_2343]) ).
tff(c_6618,plain,
! [V_760,V1_761] :
( equidistant(w,V_760,w,V1_761)
| ~ equidistant(v,V_760,v,V1_761)
| ~ equidistant(u,V_760,u,V1_761) ),
inference(negUnitSimplification,[status(thm)],[c_44,c_2356]) ).
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_6694,plain,
! [V_762] :
( ( w = V_762 )
| ~ equidistant(v,V_762,v,w)
| ~ equidistant(u,V_762,u,w) ),
inference(resolution,[status(thm)],[c_6618,c_6]) ).
tff(c_6729,plain,
( ( w1 = w )
| ~ equidistant(u,w1,u,w) ),
inference(resolution,[status(thm)],[c_163,c_6694]) ).
tff(c_6748,plain,
w1 = w,
inference(demodulation,[status(thm),theory(equality)],[c_160,c_6729]) ).
tff(c_6750,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_46,c_6748]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : GEO030-2 : TPTP v8.1.2. Released v1.0.0.
% 0.08/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 : n023.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:30:52 EDT 2023
% 0.14/0.35 % CPUTime :
% 10.26/3.56 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 10.26/3.57
% 10.26/3.57 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 10.58/3.60
% 10.58/3.60 Inference rules
% 10.58/3.60 ----------------------
% 10.58/3.60 #Ref : 0
% 10.58/3.60 #Sup : 1621
% 10.58/3.60 #Fact : 0
% 10.58/3.60 #Define : 0
% 10.58/3.60 #Split : 0
% 10.58/3.60 #Chain : 0
% 10.58/3.60 #Close : 0
% 10.58/3.60
% 10.58/3.60 Ordering : KBO
% 10.58/3.60
% 10.58/3.60 Simplification rules
% 10.58/3.60 ----------------------
% 10.58/3.60 #Subsume : 11
% 10.58/3.60 #Demod : 745
% 10.58/3.60 #Tautology : 692
% 10.58/3.60 #SimpNegUnit : 12
% 10.58/3.60 #BackRed : 0
% 10.58/3.60
% 10.58/3.60 #Partial instantiations: 0
% 10.58/3.60 #Strategies tried : 1
% 10.58/3.60
% 10.58/3.60 Timing (in seconds)
% 10.58/3.60 ----------------------
% 10.58/3.60 Preprocessing : 0.51
% 10.58/3.60 Parsing : 0.28
% 10.58/3.60 CNF conversion : 0.03
% 10.58/3.60 Main loop : 1.92
% 10.58/3.60 Inferencing : 0.62
% 10.58/3.60 Reduction : 0.70
% 10.58/3.60 Demodulation : 0.57
% 10.58/3.60 BG Simplification : 0.05
% 10.58/3.60 Subsumption : 0.43
% 10.58/3.61 Abstraction : 0.06
% 10.58/3.61 MUC search : 0.00
% 10.58/3.61 Cooper : 0.00
% 10.58/3.61 Total : 2.48
% 10.58/3.61 Index Insertion : 0.00
% 10.58/3.61 Index Deletion : 0.00
% 10.58/3.61 Index Matching : 0.00
% 10.58/3.61 BG Taut test : 0.00
%------------------------------------------------------------------------------