TSTP Solution File: GEO042-3 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : GEO042-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 : n006.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 8.85s 3.02s
% Output : CNFRefutation 8.85s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 22
% Syntax : Number of formulae : 36 ( 10 unt; 15 typ; 0 def)
% Number of atoms : 38 ( 5 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 36 ( 19 ~; 17 |; 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 : 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 : 35 (; 35 !; 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_423,axiom,
~ between(u,v,w),
file(unknown,unknown) ).
tff(f_421,axiom,
between(v,w,x),
file(unknown,unknown) ).
tff(f_420,axiom,
between(u,v,x),
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(f_107,axiom,
! [X,Y] :
( ~ between(X,Y,X)
| ( X = Y ) ),
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_381,axiom,
! [U,V,W] :
( ~ between(U,V,W)
| between(W,V,U) ),
file(unknown,unknown) ).
tff(c_108,plain,
~ between(u,v,w),
inference(cnfTransformation,[status(thm)],[f_423]) ).
tff(c_106,plain,
between(v,w,x),
inference(cnfTransformation,[status(thm)],[f_421]) ).
tff(c_104,plain,
between(u,v,x),
inference(cnfTransformation,[status(thm)],[f_420]) ).
tff(c_1699,plain,
! [V_339,Y_342,X_340,W_343,U_341] :
( between(X_340,inner_pasch(U_341,V_339,W_343,X_340,Y_342),U_341)
| ~ between(Y_342,X_340,W_343)
| ~ between(U_341,V_339,W_343) ),
inference(cnfTransformation,[status(thm)],[f_126]) ).
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_6739,plain,
! [U_590,V_591,W_592,Y_593] :
( ( inner_pasch(U_590,V_591,W_592,U_590,Y_593) = U_590 )
| ~ between(Y_593,U_590,W_592)
| ~ between(U_590,V_591,W_592) ),
inference(resolution,[status(thm)],[c_1699,c_14]) ).
tff(c_6834,plain,
! [V_595] :
( ( inner_pasch(v,V_595,x,v,u) = v )
| ~ between(v,V_595,x) ),
inference(resolution,[status(thm)],[c_104,c_6739]) ).
tff(c_6858,plain,
inner_pasch(v,w,x,v,u) = v,
inference(resolution,[status(thm)],[c_106,c_6834]) ).
tff(c_16,plain,
! [U_31,X_32,Y_33,W_30,V_34] :
( between(V_34,inner_pasch(U_31,V_34,W_30,X_32,Y_33),Y_33)
| ~ between(Y_33,X_32,W_30)
| ~ between(U_31,V_34,W_30) ),
inference(cnfTransformation,[status(thm)],[f_117]) ).
tff(c_6893,plain,
( between(w,v,u)
| ~ between(u,v,x)
| ~ between(v,w,x) ),
inference(superposition,[status(thm),theory(equality)],[c_6858,c_16]) ).
tff(c_6899,plain,
between(w,v,u),
inference(demodulation,[status(thm),theory(equality)],[c_106,c_104,c_6893]) ).
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_6914,plain,
between(u,v,w),
inference(resolution,[status(thm)],[c_6899,c_92]) ).
tff(c_6930,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_108,c_6914]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : GEO042-3 : TPTP v8.1.2. Released v1.0.0.
% 0.00/0.13 % 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.14/0.35 % Computer : n006.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:35:58 EDT 2023
% 0.14/0.35 % CPUTime :
% 8.85/3.02 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 8.85/3.03
% 8.85/3.03 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 8.85/3.06
% 8.85/3.06 Inference rules
% 8.85/3.06 ----------------------
% 8.85/3.06 #Ref : 0
% 8.85/3.06 #Sup : 1694
% 8.85/3.06 #Fact : 0
% 8.85/3.06 #Define : 0
% 8.85/3.06 #Split : 12
% 8.85/3.06 #Chain : 0
% 8.85/3.06 #Close : 0
% 8.85/3.06
% 8.85/3.06 Ordering : KBO
% 8.85/3.06
% 8.85/3.06 Simplification rules
% 8.85/3.06 ----------------------
% 8.85/3.06 #Subsume : 69
% 8.85/3.06 #Demod : 1196
% 8.85/3.06 #Tautology : 949
% 8.85/3.06 #SimpNegUnit : 30
% 8.85/3.06 #BackRed : 50
% 8.85/3.06
% 8.85/3.06 #Partial instantiations: 0
% 8.85/3.06 #Strategies tried : 1
% 8.85/3.06
% 8.85/3.06 Timing (in seconds)
% 8.85/3.06 ----------------------
% 8.85/3.06 Preprocessing : 0.62
% 8.85/3.06 Parsing : 0.29
% 8.85/3.06 CNF conversion : 0.04
% 8.85/3.06 Main loop : 1.40
% 8.85/3.06 Inferencing : 0.44
% 8.85/3.06 Reduction : 0.46
% 8.85/3.06 Demodulation : 0.35
% 8.85/3.06 BG Simplification : 0.06
% 8.85/3.06 Subsumption : 0.34
% 8.85/3.06 Abstraction : 0.07
% 8.85/3.06 MUC search : 0.00
% 8.85/3.06 Cooper : 0.00
% 8.85/3.06 Total : 2.07
% 9.08/3.06 Index Insertion : 0.00
% 9.08/3.06 Index Deletion : 0.00
% 9.08/3.06 Index Matching : 0.00
% 9.08/3.06 BG Taut test : 0.00
%------------------------------------------------------------------------------