TSTP Solution File: GEO040-2 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : GEO040-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 : 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 4.86s 2.17s
% Output : CNFRefutation 5.02s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 19
% Syntax : Number of formulae : 32 ( 10 unt; 13 typ; 0 def)
% Number of atoms : 34 ( 8 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 32 ( 17 ~; 15 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 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 : 11 ( 11 usr; 6 con; 0-6 aty)
% Number of variables : 29 (; 29 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ equidistant > between > continuous > inner_pasch > euclid2 > euclid1 > extension > #nlpp > 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(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_225,axiom,
u != v,
file(unknown,unknown) ).
tff(f_223,axiom,
between(v,u,w),
file(unknown,unknown) ).
tff(f_222,axiom,
between(u,v,w),
file(unknown,unknown) ).
tff(f_117,axiom,
! [W,U,X,Y,V] :
( ~ between(U,V,W)
| ~ between(Y,X,W)
| between(V,inner_pasch(U,V,W,X,Y),Y) ),
file(unknown,unknown) ).
tff(f_107,axiom,
! [X,Y] :
( ~ between(X,Y,X)
| ( X = Y ) ),
file(unknown,unknown) ).
tff(f_126,axiom,
! [W,U,X,Y,V] :
( ~ between(U,V,W)
| ~ between(Y,X,W)
| between(X,inner_pasch(U,V,W,X,Y),U) ),
file(unknown,unknown) ).
tff(c_42,plain,
v != u,
inference(cnfTransformation,[status(thm)],[f_225]) ).
tff(c_40,plain,
between(v,u,w),
inference(cnfTransformation,[status(thm)],[f_223]) ).
tff(c_38,plain,
between(u,v,w),
inference(cnfTransformation,[status(thm)],[f_222]) ).
tff(c_97,plain,
! [V_104,Y_100,W_103,U_101,X_102] :
( between(V_104,inner_pasch(U_101,V_104,W_103,X_102,Y_100),Y_100)
| ~ between(Y_100,X_102,W_103)
| ~ between(U_101,V_104,W_103) ),
inference(cnfTransformation,[status(thm)],[f_117]) ).
tff(c_14,plain,
! [Y_29,X_28] :
( ( Y_29 = X_28 )
| ~ between(X_28,Y_29,X_28) ),
inference(cnfTransformation,[status(thm)],[f_107]) ).
tff(c_1196,plain,
! [U_316,Y_317,W_318,X_319] :
( ( inner_pasch(U_316,Y_317,W_318,X_319,Y_317) = Y_317 )
| ~ between(Y_317,X_319,W_318)
| ~ between(U_316,Y_317,W_318) ),
inference(resolution,[status(thm)],[c_97,c_14]) ).
tff(c_1224,plain,
! [U_320] :
( ( inner_pasch(U_320,u,w,v,u) = u )
| ~ between(U_320,u,w) ),
inference(resolution,[status(thm)],[c_38,c_1196]) ).
tff(c_1228,plain,
inner_pasch(v,u,w,v,u) = u,
inference(resolution,[status(thm)],[c_40,c_1224]) ).
tff(c_18,plain,
! [V_39,W_35,U_36,X_37,Y_38] :
( between(X_37,inner_pasch(U_36,V_39,W_35,X_37,Y_38),U_36)
| ~ between(Y_38,X_37,W_35)
| ~ between(U_36,V_39,W_35) ),
inference(cnfTransformation,[status(thm)],[f_126]) ).
tff(c_1232,plain,
( between(v,u,v)
| ~ between(u,v,w)
| ~ between(v,u,w) ),
inference(superposition,[status(thm),theory(equality)],[c_1228,c_18]) ).
tff(c_1239,plain,
between(v,u,v),
inference(demodulation,[status(thm),theory(equality)],[c_40,c_38,c_1232]) ).
tff(c_1249,plain,
v = u,
inference(resolution,[status(thm)],[c_1239,c_14]) ).
tff(c_1257,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_42,c_1249]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : GEO040-2 : TPTP v8.1.2. Released v1.0.0.
% 0.13/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.35 % Computer : n010.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:07:43 EDT 2023
% 0.14/0.35 % CPUTime :
% 4.86/2.17 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 4.86/2.18
% 4.86/2.18 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 5.02/2.21
% 5.02/2.21 Inference rules
% 5.02/2.21 ----------------------
% 5.02/2.21 #Ref : 0
% 5.02/2.21 #Sup : 281
% 5.02/2.21 #Fact : 0
% 5.02/2.21 #Define : 0
% 5.02/2.21 #Split : 0
% 5.02/2.21 #Chain : 0
% 5.02/2.21 #Close : 0
% 5.02/2.21
% 5.02/2.21 Ordering : KBO
% 5.02/2.21
% 5.02/2.21 Simplification rules
% 5.02/2.21 ----------------------
% 5.02/2.21 #Subsume : 5
% 5.02/2.21 #Demod : 194
% 5.02/2.21 #Tautology : 130
% 5.02/2.21 #SimpNegUnit : 1
% 5.02/2.21 #BackRed : 0
% 5.02/2.21
% 5.02/2.21 #Partial instantiations: 0
% 5.02/2.21 #Strategies tried : 1
% 5.02/2.21
% 5.02/2.21 Timing (in seconds)
% 5.02/2.21 ----------------------
% 5.02/2.22 Preprocessing : 0.51
% 5.02/2.22 Parsing : 0.29
% 5.02/2.22 CNF conversion : 0.03
% 5.02/2.22 Main loop : 0.60
% 5.02/2.22 Inferencing : 0.22
% 5.02/2.22 Reduction : 0.17
% 5.02/2.22 Demodulation : 0.13
% 5.02/2.22 BG Simplification : 0.03
% 5.02/2.22 Subsumption : 0.13
% 5.02/2.22 Abstraction : 0.02
% 5.02/2.22 MUC search : 0.00
% 5.02/2.22 Cooper : 0.00
% 5.02/2.22 Total : 1.16
% 5.02/2.22 Index Insertion : 0.00
% 5.02/2.22 Index Deletion : 0.00
% 5.02/2.22 Index Matching : 0.00
% 5.02/2.22 BG Taut test : 0.00
%------------------------------------------------------------------------------