TSTP Solution File: GEO047-3 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : GEO047-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 : 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:38:01 EDT 2023
% Result : Unsatisfiable 6.18s 2.46s
% Output : CNFRefutation 6.42s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 20
% Syntax : Number of formulae : 32 ( 11 unt; 15 typ; 0 def)
% Number of atoms : 25 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 18 ( 10 ~; 8 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 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 : 3 ( 2 usr; 1 prp; 0-4 aty)
% Number of functors : 13 ( 13 usr; 7 con; 0-6 aty)
% Number of variables : 18 (; 18 !; 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_468,axiom,
~ between(u,v,x),
file(unknown,unknown) ).
tff(f_466,axiom,
between(u,w,x),
file(unknown,unknown) ).
tff(f_382,axiom,
! [U,V,W] :
( ~ between(U,V,W)
| between(W,V,U) ),
file(unknown,unknown) ).
tff(f_465,axiom,
between(u,v,w),
file(unknown,unknown) ).
tff(f_464,axiom,
! [U,V,X,W] :
( ~ between(U,V,X)
| ~ between(V,W,X)
| between(U,W,X) ),
file(unknown,unknown) ).
tff(c_118,plain,
~ between(u,v,x),
inference(cnfTransformation,[status(thm)],[f_468]) ).
tff(c_116,plain,
between(u,w,x),
inference(cnfTransformation,[status(thm)],[f_466]) ).
tff(c_250,plain,
! [W_228,V_229,U_230] :
( between(W_228,V_229,U_230)
| ~ between(U_230,V_229,W_228) ),
inference(cnfTransformation,[status(thm)],[f_382]) ).
tff(c_272,plain,
between(x,w,u),
inference(resolution,[status(thm)],[c_116,c_250]) ).
tff(c_114,plain,
between(u,v,w),
inference(cnfTransformation,[status(thm)],[f_465]) ).
tff(c_267,plain,
between(w,v,u),
inference(resolution,[status(thm)],[c_114,c_250]) ).
tff(c_1344,plain,
! [U_340,W_341,X_342,V_343] :
( between(U_340,W_341,X_342)
| ~ between(V_343,W_341,X_342)
| ~ between(U_340,V_343,X_342) ),
inference(cnfTransformation,[status(thm)],[f_464]) ).
tff(c_2525,plain,
! [U_402] :
( between(U_402,v,u)
| ~ between(U_402,w,u) ),
inference(resolution,[status(thm)],[c_267,c_1344]) ).
tff(c_2546,plain,
between(x,v,u),
inference(resolution,[status(thm)],[c_272,c_2525]) ).
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_382]) ).
tff(c_2590,plain,
between(u,v,x),
inference(resolution,[status(thm)],[c_2546,c_92]) ).
tff(c_2603,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_118,c_2590]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.14 % Problem : GEO047-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/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.15/0.37 % Computer : n018.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:48:36 EDT 2023
% 0.15/0.37 % CPUTime :
% 6.18/2.46 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 6.18/2.47
% 6.18/2.47 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 6.42/2.50
% 6.42/2.50 Inference rules
% 6.42/2.50 ----------------------
% 6.42/2.50 #Ref : 0
% 6.42/2.50 #Sup : 612
% 6.42/2.50 #Fact : 0
% 6.42/2.50 #Define : 0
% 6.42/2.50 #Split : 18
% 6.42/2.50 #Chain : 0
% 6.42/2.50 #Close : 0
% 6.42/2.50
% 6.42/2.50 Ordering : KBO
% 6.42/2.50
% 6.42/2.50 Simplification rules
% 6.42/2.50 ----------------------
% 6.42/2.50 #Subsume : 24
% 6.42/2.50 #Demod : 403
% 6.42/2.50 #Tautology : 311
% 6.42/2.50 #SimpNegUnit : 8
% 6.42/2.50 #BackRed : 97
% 6.42/2.50
% 6.42/2.50 #Partial instantiations: 0
% 6.42/2.50 #Strategies tried : 1
% 6.42/2.50
% 6.42/2.50 Timing (in seconds)
% 6.42/2.50 ----------------------
% 6.42/2.50 Preprocessing : 0.62
% 6.42/2.50 Parsing : 0.28
% 6.42/2.50 CNF conversion : 0.04
% 6.42/2.50 Main loop : 0.80
% 6.42/2.50 Inferencing : 0.24
% 6.42/2.50 Reduction : 0.26
% 6.42/2.50 Demodulation : 0.19
% 6.42/2.50 BG Simplification : 0.04
% 6.42/2.50 Subsumption : 0.21
% 6.42/2.50 Abstraction : 0.03
% 6.42/2.50 MUC search : 0.00
% 6.42/2.50 Cooper : 0.00
% 6.42/2.50 Total : 1.46
% 6.42/2.50 Index Insertion : 0.00
% 6.42/2.50 Index Deletion : 0.00
% 6.42/2.50 Index Matching : 0.00
% 6.42/2.50 BG Taut test : 0.00
%------------------------------------------------------------------------------