TSTP Solution File: GEO067-2 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : GEO067-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/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 : n016.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:05 EDT 2023
% Result : Unsatisfiable 3.78s 1.85s
% Output : CNFRefutation 3.78s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 22
% Syntax : Number of formulae : 49 ( 21 unt; 14 typ; 0 def)
% Number of atoms : 58 ( 8 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 56 ( 33 ~; 23 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 35 ( 8 >; 27 *; 0 +; 0 <<)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-4 aty)
% Number of functors : 11 ( 11 usr; 6 con; 0-6 aty)
% Number of variables : 45 (; 45 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ equidistant > colinear > between > continuous > inner_pasch > euclid2 > euclid1 > extension > #nlpp > z > y > x > 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(colinear,type,
colinear: ( $i * $i * $i ) > $o ).
tff(equidistant,type,
equidistant: ( $i * $i * $i * $i ) > $o ).
tff(lower_dimension_point_3,type,
lower_dimension_point_3: $i ).
tff(y,type,
y: $i ).
tff(extension,type,
extension: ( $i * $i * $i * $i ) > $i ).
tff(z,type,
z: $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_78,axiom,
! [Y,X,W,V] : equidistant(Y,extension(X,Y,W,V),W,V),
file(unknown,unknown) ).
tff(f_71,axiom,
! [X,Y,Z] :
( ~ equidistant(X,Y,Z,Z)
| ( X = Y ) ),
file(unknown,unknown) ).
tff(f_75,axiom,
! [X,Y,W,V] : between(X,Y,extension(X,Y,W,V)),
file(unknown,unknown) ).
tff(f_256,axiom,
! [Y,Z,X] :
( ~ between(Y,Z,X)
| colinear(X,Y,Z) ),
file(unknown,unknown) ).
tff(f_251,axiom,
! [X,Y,Z] :
( ~ between(X,Y,Z)
| colinear(X,Y,Z) ),
file(unknown,unknown) ).
tff(f_261,axiom,
! [Z,X,Y] :
( ~ between(Z,X,Y)
| colinear(X,Y,Z) ),
file(unknown,unknown) ).
tff(f_282,axiom,
( ~ colinear(x,x,y)
| ~ colinear(x,y,x)
| ~ colinear(y,x,x)
| ( x = y ) ),
file(unknown,unknown) ).
tff(f_293,axiom,
( ~ colinear(x,x,y)
| ~ colinear(x,y,x)
| ~ colinear(y,x,x)
| ~ colinear(x,z,y) ),
file(unknown,unknown) ).
tff(c_62,plain,
! [Y_104,X_105,W_106,V_107] : equidistant(Y_104,extension(X_105,Y_104,W_106,V_107),W_106,V_107),
inference(cnfTransformation,[status(thm)],[f_78]) ).
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_68,plain,
! [X_108,Y_109,V_110] : ( extension(X_108,Y_109,V_110,V_110) = Y_109 ),
inference(resolution,[status(thm)],[c_62,c_6]) ).
tff(c_8,plain,
! [X_12,Y_13,W_14,V_15] : between(X_12,Y_13,extension(X_12,Y_13,W_14,V_15)),
inference(cnfTransformation,[status(thm)],[f_75]) ).
tff(c_77,plain,
! [X_108,Y_109] : between(X_108,Y_109,Y_109),
inference(superposition,[status(thm),theory(equality)],[c_68,c_8]) ).
tff(c_40,plain,
! [X_77,Y_75,Z_76] :
( colinear(X_77,Y_75,Z_76)
| ~ between(Y_75,Z_76,X_77) ),
inference(cnfTransformation,[status(thm)],[f_256]) ).
tff(c_38,plain,
! [X_72,Y_73,Z_74] :
( colinear(X_72,Y_73,Z_74)
| ~ between(X_72,Y_73,Z_74) ),
inference(cnfTransformation,[status(thm)],[f_251]) ).
tff(c_42,plain,
! [X_79,Y_80,Z_78] :
( colinear(X_79,Y_80,Z_78)
| ~ between(Z_78,X_79,Y_80) ),
inference(cnfTransformation,[status(thm)],[f_261]) ).
tff(c_46,plain,
( ( y = x )
| ~ colinear(y,x,x)
| ~ colinear(x,y,x)
| ~ colinear(x,x,y) ),
inference(cnfTransformation,[status(thm)],[f_282]) ).
tff(c_96,plain,
~ colinear(x,x,y),
inference(splitLeft,[status(thm)],[c_46]) ).
tff(c_99,plain,
~ between(y,x,x),
inference(resolution,[status(thm)],[c_42,c_96]) ).
tff(c_109,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_77,c_99]) ).
tff(c_110,plain,
( ~ colinear(x,y,x)
| ~ colinear(y,x,x)
| ( y = x ) ),
inference(splitRight,[status(thm)],[c_46]) ).
tff(c_112,plain,
~ colinear(y,x,x),
inference(splitLeft,[status(thm)],[c_110]) ).
tff(c_121,plain,
~ between(y,x,x),
inference(resolution,[status(thm)],[c_38,c_112]) ).
tff(c_127,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_77,c_121]) ).
tff(c_128,plain,
( ~ colinear(x,y,x)
| ( y = x ) ),
inference(splitRight,[status(thm)],[c_110]) ).
tff(c_140,plain,
~ colinear(x,y,x),
inference(splitLeft,[status(thm)],[c_128]) ).
tff(c_146,plain,
~ between(y,x,x),
inference(resolution,[status(thm)],[c_40,c_140]) ).
tff(c_154,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_77,c_146]) ).
tff(c_155,plain,
y = x,
inference(splitRight,[status(thm)],[c_128]) ).
tff(c_156,plain,
colinear(x,y,x),
inference(splitRight,[status(thm)],[c_128]) ).
tff(c_163,plain,
colinear(x,x,x),
inference(demodulation,[status(thm),theory(equality)],[c_155,c_156]) ).
tff(c_48,plain,
( ~ colinear(x,z,y)
| ~ colinear(y,x,x)
| ~ colinear(x,y,x)
| ~ colinear(x,x,y) ),
inference(cnfTransformation,[status(thm)],[f_293]) ).
tff(c_192,plain,
~ colinear(x,z,x),
inference(demodulation,[status(thm),theory(equality)],[c_163,c_155,c_163,c_155,c_163,c_155,c_155,c_48]) ).
tff(c_198,plain,
~ between(z,x,x),
inference(resolution,[status(thm)],[c_40,c_192]) ).
tff(c_206,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_77,c_198]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : GEO067-2 : 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.12/0.34 % Computer : n016.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Fri Aug 4 01:15:23 EDT 2023
% 0.12/0.34 % CPUTime :
% 3.78/1.85 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.78/1.86
% 3.78/1.86 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 3.78/1.89
% 3.78/1.89 Inference rules
% 3.78/1.89 ----------------------
% 3.78/1.89 #Ref : 0
% 3.78/1.89 #Sup : 31
% 3.78/1.89 #Fact : 0
% 3.78/1.89 #Define : 0
% 3.78/1.89 #Split : 3
% 3.78/1.89 #Chain : 0
% 3.78/1.89 #Close : 0
% 3.78/1.89
% 3.78/1.89 Ordering : KBO
% 3.78/1.89
% 3.78/1.89 Simplification rules
% 3.78/1.89 ----------------------
% 3.78/1.89 #Subsume : 0
% 3.78/1.89 #Demod : 18
% 3.78/1.89 #Tautology : 12
% 3.78/1.89 #SimpNegUnit : 0
% 3.78/1.89 #BackRed : 2
% 3.78/1.89
% 3.78/1.89 #Partial instantiations: 0
% 3.78/1.89 #Strategies tried : 1
% 3.78/1.89
% 3.78/1.89 Timing (in seconds)
% 3.78/1.89 ----------------------
% 3.78/1.89 Preprocessing : 0.54
% 3.78/1.89 Parsing : 0.29
% 3.78/1.89 CNF conversion : 0.03
% 3.78/1.89 Main loop : 0.28
% 3.78/1.89 Inferencing : 0.10
% 3.78/1.89 Reduction : 0.07
% 3.78/1.89 Demodulation : 0.05
% 3.78/1.89 BG Simplification : 0.02
% 3.78/1.89 Subsumption : 0.06
% 3.78/1.89 Abstraction : 0.01
% 3.78/1.89 MUC search : 0.00
% 3.78/1.89 Cooper : 0.00
% 3.78/1.89 Total : 0.87
% 3.78/1.89 Index Insertion : 0.00
% 3.78/1.89 Index Deletion : 0.00
% 3.78/1.89 Index Matching : 0.00
% 3.78/1.89 BG Taut test : 0.00
%------------------------------------------------------------------------------