TSTP Solution File: GEO045-3 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : GEO045-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/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 : n011.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:01 EDT 2023
% Result : Unsatisfiable 5.16s 2.27s
% Output : CNFRefutation 5.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 21
% Syntax : Number of formulae : 35 ( 13 unt; 15 typ; 0 def)
% Number of atoms : 32 ( 5 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 25 ( 13 ~; 12 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 3 avg)
% Maximal term depth : 1 ( 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 : 13 ( 13 usr; 7 con; 0-6 aty)
% Number of variables : 19 (; 19 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ equidistant > between > continuous > inner_pasch > euclid2 > euclid1 > extension > reflection > #nlpp > 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(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_451,axiom,
~ between(u,v,x),
file(unknown,unknown) ).
tff(f_447,axiom,
between(v,w,x),
file(unknown,unknown) ).
tff(f_381,axiom,
! [U,V,W] :
( ~ between(U,V,W)
| between(W,V,U) ),
file(unknown,unknown) ).
tff(f_449,axiom,
v != w,
file(unknown,unknown) ).
tff(f_446,axiom,
between(u,v,w),
file(unknown,unknown) ).
tff(f_445,axiom,
! [U,V,W,X] :
( ~ between(U,V,W)
| ~ between(V,W,X)
| between(U,W,X)
| ( V = W ) ),
file(unknown,unknown) ).
tff(c_116,plain,
~ between(u,v,x),
inference(cnfTransformation,[status(thm)],[f_451]) ).
tff(c_112,plain,
between(v,w,x),
inference(cnfTransformation,[status(thm)],[f_447]) ).
tff(c_267,plain,
! [W_222,V_223,U_224] :
( between(W_222,V_223,U_224)
| ~ between(U_224,V_223,W_222) ),
inference(cnfTransformation,[status(thm)],[f_381]) ).
tff(c_284,plain,
between(x,w,v),
inference(resolution,[status(thm)],[c_112,c_267]) ).
tff(c_114,plain,
w != v,
inference(cnfTransformation,[status(thm)],[f_449]) ).
tff(c_110,plain,
between(u,v,w),
inference(cnfTransformation,[status(thm)],[f_446]) ).
tff(c_289,plain,
between(w,v,u),
inference(resolution,[status(thm)],[c_110,c_267]) ).
tff(c_1563,plain,
! [W_338,V_339,U_340,X_341] :
( ( W_338 = V_339 )
| between(U_340,W_338,X_341)
| ~ between(V_339,W_338,X_341)
| ~ between(U_340,V_339,W_338) ),
inference(cnfTransformation,[status(thm)],[f_445]) ).
tff(c_1567,plain,
! [U_340] :
( ( w = v )
| between(U_340,v,u)
| ~ between(U_340,w,v) ),
inference(resolution,[status(thm)],[c_289,c_1563]) ).
tff(c_1865,plain,
! [U_356] :
( between(U_356,v,u)
| ~ between(U_356,w,v) ),
inference(negUnitSimplification,[status(thm)],[c_114,c_1567]) ).
tff(c_1882,plain,
between(x,v,u),
inference(resolution,[status(thm)],[c_284,c_1865]) ).
tff(c_92,plain,
! [W_162,V_161,U_160] :
( between(W_162,V_161,U_160)
| ~ between(U_160,V_161,W_162) ),
inference(cnfTransformation,[status(thm)],[f_381]) ).
tff(c_1897,plain,
between(u,v,x),
inference(resolution,[status(thm)],[c_1882,c_92]) ).
tff(c_1907,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_116,c_1897]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.14 % Problem : GEO045-3 : TPTP v8.1.2. Released v1.0.0.
% 0.00/0.15 % 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.15/0.37 % Computer : n011.cluster.edu
% 0.15/0.37 % Model : x86_64 x86_64
% 0.15/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.37 % Memory : 8042.1875MB
% 0.15/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.37 % CPULimit : 300
% 0.15/0.37 % WCLimit : 300
% 0.15/0.37 % DateTime : Fri Aug 4 00:44:06 EDT 2023
% 0.15/0.37 % CPUTime :
% 5.16/2.27 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 5.16/2.28
% 5.16/2.28 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 5.16/2.30
% 5.16/2.30 Inference rules
% 5.16/2.30 ----------------------
% 5.16/2.30 #Ref : 0
% 5.16/2.30 #Sup : 427
% 5.16/2.30 #Fact : 0
% 5.16/2.30 #Define : 0
% 5.16/2.30 #Split : 6
% 5.16/2.30 #Chain : 0
% 5.16/2.30 #Close : 0
% 5.16/2.30
% 5.16/2.30 Ordering : KBO
% 5.16/2.30
% 5.16/2.30 Simplification rules
% 5.16/2.30 ----------------------
% 5.16/2.30 #Subsume : 16
% 5.16/2.30 #Demod : 299
% 5.16/2.30 #Tautology : 292
% 5.16/2.30 #SimpNegUnit : 19
% 5.16/2.30 #BackRed : 30
% 5.16/2.30
% 5.16/2.30 #Partial instantiations: 0
% 5.16/2.30 #Strategies tried : 1
% 5.16/2.30
% 5.16/2.30 Timing (in seconds)
% 5.16/2.30 ----------------------
% 5.16/2.31 Preprocessing : 0.61
% 5.16/2.31 Parsing : 0.28
% 5.16/2.31 CNF conversion : 0.04
% 5.16/2.31 Main loop : 0.60
% 5.16/2.31 Inferencing : 0.19
% 5.16/2.31 Reduction : 0.20
% 5.16/2.31 Demodulation : 0.15
% 5.16/2.31 BG Simplification : 0.03
% 5.16/2.31 Subsumption : 0.15
% 5.16/2.31 Abstraction : 0.03
% 5.16/2.31 MUC search : 0.00
% 5.16/2.31 Cooper : 0.00
% 5.16/2.31 Total : 1.27
% 5.16/2.31 Index Insertion : 0.00
% 5.16/2.31 Index Deletion : 0.00
% 5.16/2.31 Index Matching : 0.00
% 5.16/2.31 BG Taut test : 0.00
%------------------------------------------------------------------------------