TSTP Solution File: GEO011-4 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : GEO011-4 : 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:37:53 EDT 2023
% Result : Unsatisfiable 3.18s 1.79s
% Output : CNFRefutation 3.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 17
% Syntax : Number of formulae : 24 ( 9 unt; 12 typ; 0 def)
% Number of atoms : 20 ( 0 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 16 ( 8 ~; 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 : 35 ( 9 >; 26 *; 0 +; 0 <<)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 9 ( 9 usr; 3 con; 0-6 aty)
% Number of variables : 6 (; 6 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ colinear > between > equal_distance > continuous > inner_pasch > euclid2 > euclid1 > extension > distance > #nlpp > 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(distance,type,
distance: ( $i * $i ) > $i ).
tff(colinear,type,
colinear: ( $i * $i * $i ) > $o ).
tff(lower_dimension_point_3,type,
lower_dimension_point_3: $i ).
tff(extension,type,
extension: ( $i * $i * $i * $i ) > $i ).
tff(euclid1,type,
euclid1: ( $i * $i * $i * $i * $i ) > $i ).
tff(equal_distance,type,
equal_distance: ( $i * $i ) > $o ).
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_151,axiom,
~ between(lower_dimension_point_1,lower_dimension_point_2,lower_dimension_point_3),
file(unknown,unknown) ).
tff(f_154,axiom,
~ between(lower_dimension_point_2,lower_dimension_point_3,lower_dimension_point_1),
file(unknown,unknown) ).
tff(f_157,axiom,
~ between(lower_dimension_point_3,lower_dimension_point_1,lower_dimension_point_2),
file(unknown,unknown) ).
tff(f_241,axiom,
colinear(lower_dimension_point_1,lower_dimension_point_2,lower_dimension_point_3),
file(unknown,unknown) ).
tff(f_73,axiom,
! [X,Y,Z] :
( ~ colinear(X,Y,Z)
| between(X,Y,Z)
| between(Y,Z,X)
| between(Z,X,Y) ),
file(unknown,unknown) ).
tff(c_28,plain,
~ between(lower_dimension_point_1,lower_dimension_point_2,lower_dimension_point_3),
inference(cnfTransformation,[status(thm)],[f_151]) ).
tff(c_30,plain,
~ between(lower_dimension_point_2,lower_dimension_point_3,lower_dimension_point_1),
inference(cnfTransformation,[status(thm)],[f_154]) ).
tff(c_32,plain,
~ between(lower_dimension_point_3,lower_dimension_point_1,lower_dimension_point_2),
inference(cnfTransformation,[status(thm)],[f_157]) ).
tff(c_46,plain,
colinear(lower_dimension_point_1,lower_dimension_point_2,lower_dimension_point_3),
inference(cnfTransformation,[status(thm)],[f_241]) ).
tff(c_94,plain,
! [Z_115,X_116,Y_117] :
( between(Z_115,X_116,Y_117)
| between(Y_117,Z_115,X_116)
| between(X_116,Y_117,Z_115)
| ~ colinear(X_116,Y_117,Z_115) ),
inference(cnfTransformation,[status(thm)],[f_73]) ).
tff(c_106,plain,
( between(lower_dimension_point_3,lower_dimension_point_1,lower_dimension_point_2)
| between(lower_dimension_point_2,lower_dimension_point_3,lower_dimension_point_1)
| between(lower_dimension_point_1,lower_dimension_point_2,lower_dimension_point_3) ),
inference(resolution,[status(thm)],[c_46,c_94]) ).
tff(c_113,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_28,c_30,c_32,c_106]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : GEO011-4 : TPTP v8.1.2. Released v1.0.0.
% 0.14/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:01:59 EDT 2023
% 0.14/0.35 % CPUTime :
% 3.18/1.79 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.18/1.79
% 3.18/1.79 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 3.18/1.82
% 3.18/1.82 Inference rules
% 3.18/1.82 ----------------------
% 3.18/1.82 #Ref : 0
% 3.18/1.82 #Sup : 12
% 3.18/1.82 #Fact : 0
% 3.18/1.82 #Define : 0
% 3.18/1.82 #Split : 0
% 3.18/1.82 #Chain : 0
% 3.18/1.82 #Close : 0
% 3.18/1.82
% 3.18/1.82 Ordering : KBO
% 3.18/1.82
% 3.18/1.82 Simplification rules
% 3.18/1.82 ----------------------
% 3.18/1.82 #Subsume : 0
% 3.18/1.82 #Demod : 0
% 3.18/1.82 #Tautology : 8
% 3.18/1.82 #SimpNegUnit : 1
% 3.18/1.82 #BackRed : 0
% 3.18/1.82
% 3.18/1.82 #Partial instantiations: 0
% 3.18/1.82 #Strategies tried : 1
% 3.18/1.82
% 3.18/1.82 Timing (in seconds)
% 3.18/1.82 ----------------------
% 3.18/1.83 Preprocessing : 0.47
% 3.18/1.83 Parsing : 0.20
% 3.18/1.83 CNF conversion : 0.03
% 3.18/1.83 Main loop : 0.26
% 3.37/1.83 Inferencing : 0.12
% 3.37/1.83 Reduction : 0.06
% 3.37/1.83 Demodulation : 0.04
% 3.37/1.83 BG Simplification : 0.02
% 3.37/1.83 Subsumption : 0.05
% 3.37/1.83 Abstraction : 0.01
% 3.37/1.83 MUC search : 0.00
% 3.37/1.83 Cooper : 0.00
% 3.37/1.83 Total : 0.78
% 3.37/1.83 Index Insertion : 0.00
% 3.37/1.83 Index Deletion : 0.00
% 3.37/1.83 Index Matching : 0.00
% 3.37/1.83 BG Taut test : 0.00
%------------------------------------------------------------------------------