TSTP Solution File: GEO036-3 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : GEO036-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 : n028.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:59 EDT 2023
% Result : Unsatisfiable 4.07s 1.91s
% Output : CNFRefutation 4.07s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 16
% Syntax : Number of formulae : 31 ( 17 unt; 11 typ; 0 def)
% Number of atoms : 25 ( 11 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 12 ( 7 ~; 5 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 3 ( 2 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 : 9 ( 9 usr; 3 con; 0-6 aty)
% Number of variables : 8 (; 8 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ equidistant > between > continuous > inner_pasch > euclid2 > euclid1 > extension > reflection > #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(equidistant,type,
equidistant: ( $i * $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(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_368,axiom,
! [U,V] : between(U,V,V),
file(unknown,unknown) ).
tff(f_383,axiom,
! [U,V] : between(U,U,V),
file(unknown,unknown) ).
tff(f_476,axiom,
( ( lower_dimension_point_1 = lower_dimension_point_2 )
| ( lower_dimension_point_2 = lower_dimension_point_3 )
| ( lower_dimension_point_1 = lower_dimension_point_3 ) ),
file(unknown,unknown) ).
tff(f_130,axiom,
~ between(lower_dimension_point_1,lower_dimension_point_2,lower_dimension_point_3),
file(unknown,unknown) ).
tff(f_133,axiom,
~ between(lower_dimension_point_2,lower_dimension_point_3,lower_dimension_point_1),
file(unknown,unknown) ).
tff(c_88,plain,
! [U_154,V_155] : between(U_154,V_155,V_155),
inference(cnfTransformation,[status(thm)],[f_368]) ).
tff(c_94,plain,
! [U_163,V_164] : between(U_163,U_163,V_164),
inference(cnfTransformation,[status(thm)],[f_383]) ).
tff(c_116,plain,
( ( lower_dimension_point_3 = lower_dimension_point_1 )
| ( lower_dimension_point_3 = lower_dimension_point_2 )
| ( lower_dimension_point_2 = lower_dimension_point_1 ) ),
inference(cnfTransformation,[status(thm)],[f_476]) ).
tff(c_145,plain,
lower_dimension_point_2 = lower_dimension_point_1,
inference(splitLeft,[status(thm)],[c_116]) ).
tff(c_20,plain,
~ between(lower_dimension_point_1,lower_dimension_point_2,lower_dimension_point_3),
inference(cnfTransformation,[status(thm)],[f_130]) ).
tff(c_146,plain,
~ between(lower_dimension_point_1,lower_dimension_point_1,lower_dimension_point_3),
inference(demodulation,[status(thm),theory(equality)],[c_145,c_20]) ).
tff(c_151,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_94,c_146]) ).
tff(c_152,plain,
( ( lower_dimension_point_3 = lower_dimension_point_2 )
| ( lower_dimension_point_3 = lower_dimension_point_1 ) ),
inference(splitRight,[status(thm)],[c_116]) ).
tff(c_154,plain,
lower_dimension_point_3 = lower_dimension_point_1,
inference(splitLeft,[status(thm)],[c_152]) ).
tff(c_22,plain,
~ between(lower_dimension_point_2,lower_dimension_point_3,lower_dimension_point_1),
inference(cnfTransformation,[status(thm)],[f_133]) ).
tff(c_156,plain,
~ between(lower_dimension_point_2,lower_dimension_point_1,lower_dimension_point_1),
inference(demodulation,[status(thm),theory(equality)],[c_154,c_22]) ).
tff(c_160,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_88,c_156]) ).
tff(c_161,plain,
lower_dimension_point_3 = lower_dimension_point_2,
inference(splitRight,[status(thm)],[c_152]) ).
tff(c_163,plain,
~ between(lower_dimension_point_1,lower_dimension_point_2,lower_dimension_point_2),
inference(demodulation,[status(thm),theory(equality)],[c_161,c_20]) ).
tff(c_168,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_88,c_163]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.14 % Problem : GEO036-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.36 % Computer : n028.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Fri Aug 4 00:41:09 EDT 2023
% 0.15/0.36 % CPUTime :
% 4.07/1.91 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 4.07/1.91
% 4.07/1.91 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 4.07/1.94
% 4.07/1.94 Inference rules
% 4.07/1.94 ----------------------
% 4.07/1.94 #Ref : 0
% 4.07/1.94 #Sup : 4
% 4.07/1.94 #Fact : 0
% 4.07/1.94 #Define : 0
% 4.07/1.94 #Split : 2
% 4.07/1.94 #Chain : 0
% 4.07/1.94 #Close : 0
% 4.07/1.94
% 4.07/1.94 Ordering : KBO
% 4.07/1.94
% 4.07/1.94 Simplification rules
% 4.07/1.94 ----------------------
% 4.07/1.94 #Subsume : 2
% 4.07/1.94 #Demod : 17
% 4.07/1.94 #Tautology : 8
% 4.07/1.94 #SimpNegUnit : 0
% 4.07/1.94 #BackRed : 9
% 4.07/1.94
% 4.07/1.94 #Partial instantiations: 0
% 4.07/1.94 #Strategies tried : 1
% 4.07/1.94
% 4.07/1.94 Timing (in seconds)
% 4.07/1.94 ----------------------
% 4.21/1.94 Preprocessing : 0.61
% 4.21/1.94 Parsing : 0.28
% 4.21/1.94 CNF conversion : 0.04
% 4.22/1.94 Main loop : 0.25
% 4.22/1.94 Inferencing : 0.04
% 4.22/1.94 Reduction : 0.09
% 4.22/1.94 Demodulation : 0.07
% 4.22/1.94 BG Simplification : 0.03
% 4.22/1.94 Subsumption : 0.08
% 4.22/1.94 Abstraction : 0.01
% 4.22/1.94 MUC search : 0.00
% 4.22/1.94 Cooper : 0.00
% 4.22/1.94 Total : 0.91
% 4.22/1.94 Index Insertion : 0.00
% 4.22/1.94 Index Deletion : 0.00
% 4.22/1.94 Index Matching : 0.00
% 4.22/1.94 BG Taut test : 0.00
%------------------------------------------------------------------------------