TSTP Solution File: GEO058-2 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : GEO058-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 : 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:38:04 EDT 2023
% Result : Unsatisfiable 3.58s 1.79s
% Output : CNFRefutation 3.58s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 20
% Syntax : Number of formulae : 33 ( 15 unt; 13 typ; 0 def)
% Number of atoms : 27 ( 9 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 16 ( 9 ~; 7 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 34 ( 8 >; 26 *; 0 +; 0 <<)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-4 aty)
% Number of functors : 11 ( 11 usr; 5 con; 0-6 aty)
% Number of variables : 40 (; 40 !; 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_250,axiom,
u != v,
file(unknown,unknown) ).
tff(f_248,axiom,
v = reflection(u,v),
file(unknown,unknown) ).
tff(f_245,axiom,
! [U,V] : ( reflection(U,V) = extension(U,V,U,V) ),
file(unknown,unknown) ).
tff(f_78,axiom,
! [Y,X,W,V] : equidistant(Y,extension(X,Y,W,V),W,V),
file(unknown,unknown) ).
tff(f_56,axiom,
! [X,Y] : equidistant(X,Y,Y,X),
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_71,axiom,
! [X,Y,Z] :
( ~ equidistant(X,Y,Z,Z)
| ( X = Y ) ),
file(unknown,unknown) ).
tff(c_42,plain,
v != u,
inference(cnfTransformation,[status(thm)],[f_250]) ).
tff(c_40,plain,
reflection(u,v) = v,
inference(cnfTransformation,[status(thm)],[f_248]) ).
tff(c_38,plain,
! [U_72,V_73] : ( extension(U_72,V_73,U_72,V_73) = reflection(U_72,V_73) ),
inference(cnfTransformation,[status(thm)],[f_245]) ).
tff(c_73,plain,
! [Y_89,X_90,W_91,V_92] : equidistant(Y_89,extension(X_90,Y_89,W_91,V_92),W_91,V_92),
inference(cnfTransformation,[status(thm)],[f_78]) ).
tff(c_149,plain,
! [V_112,U_113] : equidistant(V_112,reflection(U_113,V_112),U_113,V_112),
inference(superposition,[status(thm),theory(equality)],[c_38,c_73]) ).
tff(c_161,plain,
equidistant(v,v,u,v),
inference(superposition,[status(thm),theory(equality)],[c_40,c_149]) ).
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_113,plain,
! [V2_99,Z_100,X_103,Y_101,V_98,W_102] :
( equidistant(Z_100,V_98,V2_99,W_102)
| ~ equidistant(X_103,Y_101,V2_99,W_102)
| ~ equidistant(X_103,Y_101,Z_100,V_98) ),
inference(cnfTransformation,[status(thm)],[f_65]) ).
tff(c_169,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_113]) ).
tff(c_180,plain,
equidistant(u,v,v,v),
inference(resolution,[status(thm)],[c_161,c_169]) ).
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_206,plain,
v = u,
inference(resolution,[status(thm)],[c_180,c_6]) ).
tff(c_212,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_42,c_206]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.14 % Problem : GEO058-2 : TPTP v8.1.2. Released v1.0.0.
% 0.07/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.36 % Computer : n023.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 01:01:52 EDT 2023
% 0.14/0.36 % CPUTime :
% 3.58/1.79 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.58/1.79
% 3.58/1.79 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 3.58/1.82
% 3.58/1.82 Inference rules
% 3.58/1.82 ----------------------
% 3.58/1.82 #Ref : 0
% 3.58/1.82 #Sup : 40
% 3.58/1.82 #Fact : 0
% 3.58/1.82 #Define : 0
% 3.58/1.82 #Split : 0
% 3.58/1.82 #Chain : 0
% 3.58/1.82 #Close : 0
% 3.58/1.82
% 3.58/1.82 Ordering : KBO
% 3.58/1.82
% 3.58/1.82 Simplification rules
% 3.58/1.82 ----------------------
% 3.58/1.82 #Subsume : 0
% 3.58/1.82 #Demod : 7
% 3.58/1.82 #Tautology : 19
% 3.58/1.82 #SimpNegUnit : 1
% 3.58/1.82 #BackRed : 0
% 3.58/1.82
% 3.58/1.82 #Partial instantiations: 0
% 3.58/1.82 #Strategies tried : 1
% 3.58/1.82
% 3.58/1.82 Timing (in seconds)
% 3.58/1.82 ----------------------
% 3.58/1.82 Preprocessing : 0.51
% 3.58/1.82 Parsing : 0.28
% 3.58/1.82 CNF conversion : 0.03
% 3.58/1.82 Main loop : 0.26
% 3.58/1.82 Inferencing : 0.10
% 3.58/1.82 Reduction : 0.08
% 3.58/1.82 Demodulation : 0.05
% 3.58/1.82 BG Simplification : 0.02
% 3.58/1.82 Subsumption : 0.05
% 3.58/1.82 Abstraction : 0.01
% 3.58/1.82 MUC search : 0.00
% 3.58/1.82 Cooper : 0.00
% 3.58/1.82 Total : 0.81
% 3.58/1.82 Index Insertion : 0.00
% 3.58/1.82 Index Deletion : 0.00
% 3.58/1.82 Index Matching : 0.00
% 3.58/1.82 BG Taut test : 0.00
%------------------------------------------------------------------------------