TSTP Solution File: GEO022-2 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : GEO022-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/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 : n018.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:56 EDT 2023
% Result : Unsatisfiable 3.22s 1.85s
% Output : CNFRefutation 3.56s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 21
% Syntax : Number of formulae : 33 ( 12 unt; 16 typ; 0 def)
% Number of atoms : 24 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 16 ( 9 ~; 7 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 3 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 : 3 ( 2 usr; 1 prp; 0-4 aty)
% Number of functors : 14 ( 14 usr; 9 con; 0-6 aty)
% Number of variables : 24 (; 24 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ equidistant > between > continuous > inner_pasch > euclid2 > euclid1 > extension > #nlpp > z > y > 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(y,type,
y: $i ).
tff(v,type,
v: $i ).
tff(extension,type,
extension: ( $i * $i * $i * $i ) > $i ).
tff(z,type,
z: $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_226,axiom,
~ equidistant(u,v,y,z),
file(unknown,unknown) ).
tff(f_57,axiom,
! [X,Y] : equidistant(X,Y,Y,X),
file(unknown,unknown) ).
tff(f_223,axiom,
equidistant(u,v,w,x),
file(unknown,unknown) ).
tff(f_66,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(w,x,y,z),
file(unknown,unknown) ).
tff(c_42,plain,
~ equidistant(u,v,y,z),
inference(cnfTransformation,[status(thm)],[f_226]) ).
tff(c_2,plain,
! [X_1,Y_2] : equidistant(X_1,Y_2,Y_2,X_1),
inference(cnfTransformation,[status(thm)],[f_57]) ).
tff(c_38,plain,
equidistant(u,v,w,x),
inference(cnfTransformation,[status(thm)],[f_223]) ).
tff(c_87,plain,
! [V_94,V2_95,X_99,W_98,Y_97,Z_96] :
( equidistant(Z_96,V_94,V2_95,W_98)
| ~ equidistant(X_99,Y_97,V2_95,W_98)
| ~ equidistant(X_99,Y_97,Z_96,V_94) ),
inference(cnfTransformation,[status(thm)],[f_66]) ).
tff(c_109,plain,
! [Z_105,V_106] :
( equidistant(Z_105,V_106,w,x)
| ~ equidistant(u,v,Z_105,V_106) ),
inference(resolution,[status(thm)],[c_38,c_87]) ).
tff(c_116,plain,
equidistant(v,u,w,x),
inference(resolution,[status(thm)],[c_2,c_109]) ).
tff(c_147,plain,
! [Z_114,V_115,Y_116,X_117] :
( equidistant(Z_114,V_115,Y_116,X_117)
| ~ equidistant(X_117,Y_116,Z_114,V_115) ),
inference(resolution,[status(thm)],[c_2,c_87]) ).
tff(c_169,plain,
equidistant(w,x,u,v),
inference(resolution,[status(thm)],[c_116,c_147]) ).
tff(c_40,plain,
equidistant(w,x,y,z),
inference(cnfTransformation,[status(thm)],[f_224]) ).
tff(c_101,plain,
! [Z_96,V_94] :
( equidistant(Z_96,V_94,y,z)
| ~ equidistant(w,x,Z_96,V_94) ),
inference(resolution,[status(thm)],[c_40,c_87]) ).
tff(c_242,plain,
equidistant(u,v,y,z),
inference(resolution,[status(thm)],[c_169,c_101]) ).
tff(c_249,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_42,c_242]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.14 % Problem : GEO022-2 : TPTP v8.1.2. Released v1.0.0.
% 0.00/0.15 % 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.37 % Computer : n018.cluster.edu
% 0.14/0.37 % Model : x86_64 x86_64
% 0.14/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.37 % Memory : 8042.1875MB
% 0.14/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.37 % CPULimit : 300
% 0.14/0.37 % WCLimit : 300
% 0.14/0.37 % DateTime : Fri Aug 4 00:28:36 EDT 2023
% 0.14/0.37 % CPUTime :
% 3.22/1.85 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.22/1.86
% 3.22/1.86 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 3.56/1.89
% 3.56/1.89 Inference rules
% 3.56/1.89 ----------------------
% 3.56/1.89 #Ref : 0
% 3.56/1.89 #Sup : 52
% 3.56/1.89 #Fact : 0
% 3.56/1.89 #Define : 0
% 3.56/1.89 #Split : 0
% 3.56/1.89 #Chain : 0
% 3.56/1.89 #Close : 0
% 3.56/1.89
% 3.56/1.89 Ordering : KBO
% 3.56/1.89
% 3.56/1.89 Simplification rules
% 3.56/1.89 ----------------------
% 3.56/1.89 #Subsume : 0
% 3.56/1.89 #Demod : 9
% 3.56/1.89 #Tautology : 15
% 3.56/1.89 #SimpNegUnit : 1
% 3.56/1.89 #BackRed : 0
% 3.56/1.89
% 3.56/1.89 #Partial instantiations: 0
% 3.56/1.89 #Strategies tried : 1
% 3.56/1.89
% 3.56/1.89 Timing (in seconds)
% 3.56/1.89 ----------------------
% 3.56/1.90 Preprocessing : 0.48
% 3.56/1.90 Parsing : 0.27
% 3.56/1.90 CNF conversion : 0.03
% 3.56/1.90 Main loop : 0.33
% 3.56/1.90 Inferencing : 0.13
% 3.56/1.90 Reduction : 0.09
% 3.56/1.90 Demodulation : 0.06
% 3.56/1.90 BG Simplification : 0.02
% 3.56/1.90 Subsumption : 0.08
% 3.56/1.90 Abstraction : 0.01
% 3.56/1.90 MUC search : 0.00
% 3.56/1.90 Cooper : 0.00
% 3.56/1.90 Total : 0.87
% 3.56/1.90 Index Insertion : 0.00
% 3.56/1.90 Index Deletion : 0.00
% 3.56/1.90 Index Matching : 0.00
% 3.56/1.90 BG Taut test : 0.00
%------------------------------------------------------------------------------