TSTP Solution File: GEO059-3 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : GEO059-3 : 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/sandbox2/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox2/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s
% Computer : n013.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:04 EDT 2023
% Result : Unsatisfiable 4.48s 2.15s
% Output : CNFRefutation 4.48s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 18
% Syntax : Number of formulae : 30 ( 9 unt; 13 typ; 0 def)
% Number of atoms : 27 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 22 ( 12 ~; 10 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 34 ( 8 >; 26 *; 0 +; 0 <<)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-4 aty)
% Number of functors : 11 ( 11 usr; 5 con; 0-6 aty)
% Number of variables : 48 (; 48 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ equidistant > between > continuous > inner_pasch > euclid2 > euclid1 > extension > reflection > #nlpp > 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(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(inner_pasch,type,
inner_pasch: ( $i * $i * $i * $i * $i ) > $i ).
tff(continuous,type,
continuous: ( $i * $i * $i * $i * $i * $i ) > $i ).
tff(f_303,axiom,
! [V,U] : equidistant(V,reflection(U,V),U,V),
file(unknown,unknown) ).
tff(f_274,axiom,
! [U,V,W,X] :
( ~ equidistant(U,V,W,X)
| equidistant(W,X,V,U) ),
file(unknown,unknown) ).
tff(f_292,axiom,
! [W,U,Z,X,Y,V] :
( ~ equidistant(U,V,W,X)
| ~ equidistant(W,X,Y,Z)
| equidistant(U,V,Y,Z) ),
file(unknown,unknown) ).
tff(f_284,axiom,
! [U,V,W,X] :
( ~ equidistant(U,V,W,X)
| equidistant(X,W,V,U) ),
file(unknown,unknown) ).
tff(f_364,axiom,
~ equidistant(v,u,v,reflection(reflection(u,v),v)),
file(unknown,unknown) ).
tff(c_64,plain,
! [V_120,U_121] : equidistant(V_120,reflection(U_121,V_120),U_121,V_120),
inference(cnfTransformation,[status(thm)],[f_303]) ).
tff(c_205,plain,
! [W_184,X_185,V_186,U_187] :
( equidistant(W_184,X_185,V_186,U_187)
| ~ equidistant(U_187,V_186,W_184,X_185) ),
inference(cnfTransformation,[status(thm)],[f_274]) ).
tff(c_224,plain,
! [U_188,V_189] : equidistant(U_188,V_189,reflection(U_188,V_189),V_189),
inference(resolution,[status(thm)],[c_64,c_205]) ).
tff(c_50,plain,
! [W_94,X_95,V_93,U_92] :
( equidistant(W_94,X_95,V_93,U_92)
| ~ equidistant(U_92,V_93,W_94,X_95) ),
inference(cnfTransformation,[status(thm)],[f_274]) ).
tff(c_230,plain,
! [U_188,V_189] : equidistant(reflection(U_188,V_189),V_189,V_189,U_188),
inference(resolution,[status(thm)],[c_224,c_50]) ).
tff(c_944,plain,
! [W_263,U_264,Z_259,Y_261,V_260,X_262] :
( equidistant(U_264,V_260,Y_261,Z_259)
| ~ equidistant(W_263,X_262,Y_261,Z_259)
| ~ equidistant(U_264,V_260,W_263,X_262) ),
inference(cnfTransformation,[status(thm)],[f_292]) ).
tff(c_1107,plain,
! [U_271,V_272,U_273,V_274] :
( equidistant(U_271,V_272,U_273,V_274)
| ~ equidistant(U_271,V_272,V_274,reflection(U_273,V_274)) ),
inference(resolution,[status(thm)],[c_64,c_944]) ).
tff(c_1279,plain,
! [U_283,V_284] : equidistant(reflection(reflection(U_283,V_284),V_284),V_284,U_283,V_284),
inference(resolution,[status(thm)],[c_230,c_1107]) ).
tff(c_54,plain,
! [X_103,W_102,V_101,U_100] :
( equidistant(X_103,W_102,V_101,U_100)
| ~ equidistant(U_100,V_101,W_102,X_103) ),
inference(cnfTransformation,[status(thm)],[f_284]) ).
tff(c_1317,plain,
! [V_284,U_283] : equidistant(V_284,U_283,V_284,reflection(reflection(U_283,V_284),V_284)),
inference(resolution,[status(thm)],[c_1279,c_54]) ).
tff(c_84,plain,
~ equidistant(v,u,v,reflection(reflection(u,v),v)),
inference(cnfTransformation,[status(thm)],[f_364]) ).
tff(c_1364,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_1317,c_84]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : GEO059-3 : TPTP v8.1.2. Released v1.0.0.
% 0.00/0.14 % Command : java -Dfile.encoding=UTF-8 -Xms512M -Xmx4G -Xss10M -jar /export/starexec/sandbox2/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox2/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s
% 0.14/0.36 % Computer : n013.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.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Fri Aug 4 00:37:33 EDT 2023
% 0.14/0.36 % CPUTime :
% 4.48/2.15 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 4.48/2.15
% 4.48/2.15 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 4.48/2.18
% 4.48/2.18 Inference rules
% 4.48/2.18 ----------------------
% 4.48/2.18 #Ref : 0
% 4.48/2.18 #Sup : 310
% 4.48/2.18 #Fact : 0
% 4.48/2.18 #Define : 0
% 4.48/2.18 #Split : 0
% 4.48/2.18 #Chain : 0
% 4.48/2.18 #Close : 0
% 4.48/2.18
% 4.48/2.18 Ordering : KBO
% 4.48/2.18
% 4.48/2.18 Simplification rules
% 4.48/2.18 ----------------------
% 4.48/2.18 #Subsume : 4
% 4.48/2.18 #Demod : 228
% 4.48/2.18 #Tautology : 223
% 4.48/2.18 #SimpNegUnit : 0
% 4.48/2.18 #BackRed : 1
% 4.48/2.18
% 4.48/2.18 #Partial instantiations: 0
% 4.48/2.18 #Strategies tried : 1
% 4.48/2.18
% 4.48/2.18 Timing (in seconds)
% 4.48/2.18 ----------------------
% 4.48/2.18 Preprocessing : 0.60
% 4.48/2.18 Parsing : 0.28
% 4.48/2.19 CNF conversion : 0.04
% 4.48/2.19 Main loop : 0.50
% 4.48/2.19 Inferencing : 0.17
% 4.48/2.19 Reduction : 0.16
% 4.48/2.19 Demodulation : 0.12
% 4.48/2.19 BG Simplification : 0.03
% 4.48/2.19 Subsumption : 0.12
% 4.48/2.19 Abstraction : 0.02
% 4.48/2.19 MUC search : 0.00
% 4.48/2.19 Cooper : 0.00
% 4.48/2.19 Total : 1.15
% 4.48/2.19 Index Insertion : 0.00
% 4.48/2.19 Index Deletion : 0.00
% 4.48/2.19 Index Matching : 0.00
% 4.48/2.19 BG Taut test : 0.00
%------------------------------------------------------------------------------