%------------------------------------------------------------------------------
% File : Beagle---0.9.52
% Problem : GEO006-3 : TPTP v9.0.0. 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 : n031.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 : Wed Apr 9 06:13:25 PM UTC 2025
% Result : Unsatisfiable 5.44s 2.34s
% Output : CNFRefutation 5.44s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 6
% Syntax : Number of formulae : 20 ( 12 unt; 0 typ; 0 def)
% Number of atoms : 32 ( 12 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 26 ( 14 ~; 12 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-4 aty)
% Number of functors : 12 ( 12 usr; 6 con; 0-6 aty)
% Number of variables : 12 ( 12 !; 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 > d > c > a
%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(a,type,
a: $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(d,type,
d: $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(c,type,
c: $i ).
tff(f_408,axiom,
c != d,
file(unknown,unknown) ).
tff(f_409,axiom,
between(a,c,d),
file(unknown,unknown) ).
tff(f_404,axiom,
a != c,
file(unknown,unknown) ).
tff(f_412,axiom,
( between(c,a,d)
| between(a,d,c) ),
file(unknown,unknown) ).
tff(f_394,axiom,
! [U,V,W] :
( ~ between(U,V,W)
| ~ between(V,U,W)
| ( U = V ) ),
file(unknown,unknown) ).
tff(f_402,axiom,
! [U,V,W] :
( ~ between(U,V,W)
| ~ between(U,W,V)
| ( V = W ) ),
file(unknown,unknown) ).
tff(c_104,plain,
d != c,
inference(cnfTransformation,[status(thm)],[f_408]) ).
tff(c_106,plain,
between(a,c,d),
inference(cnfTransformation,[status(thm)],[f_409]) ).
tff(c_100,plain,
c != a,
inference(cnfTransformation,[status(thm)],[f_404]) ).
tff(c_108,plain,
( between(a,d,c)
| between(c,a,d) ),
inference(cnfTransformation,[status(thm)],[f_412]) ).
tff(c_251,plain,
between(c,a,d),
inference(splitLeft,[status(thm)],[c_108]) ).
tff(c_861,plain,
! [V_274,U_275,W_276] :
( ( V_274 = U_275 )
| ~ between(V_274,U_275,W_276)
| ~ between(U_275,V_274,W_276) ),
inference(cnfTransformation,[status(thm)],[f_394]) ).
tff(c_871,plain,
( ( c = a )
| ~ between(a,c,d) ),
inference(resolution,[status(thm)],[c_251,c_861]) ).
tff(c_892,plain,
c = a,
inference(demodulation,[status(thm),theory(equality)],[c_106,c_871]) ).
tff(c_894,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_100,c_892]) ).
tff(c_895,plain,
between(a,d,c),
inference(splitRight,[status(thm)],[c_108]) ).
tff(c_1665,plain,
! [W_362,V_363,U_364] :
( ( W_362 = V_363 )
| ~ between(U_364,W_362,V_363)
| ~ between(U_364,V_363,W_362) ),
inference(cnfTransformation,[status(thm)],[f_402]) ).
tff(c_1675,plain,
( ( d = c )
| ~ between(a,c,d) ),
inference(resolution,[status(thm)],[c_895,c_1665]) ).
tff(c_1695,plain,
d = c,
inference(demodulation,[status(thm),theory(equality)],[c_106,c_1675]) ).
tff(c_1697,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_104,c_1695]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.09 % Problem : GEO006-3 : TPTP v9.0.0. Released v1.0.0.
% 0.02/0.10 % 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.09/0.30 % Computer : n031.cluster.edu
% 0.09/0.30 % Model : x86_64 x86_64
% 0.09/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.30 % Memory : 8042.1875MB
% 0.09/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.30 % CPULimit : 300
% 0.09/0.30 % WCLimit : 300
% 0.09/0.30 % DateTime : Mon Apr 7 19:15:52 EDT 2025
% 0.09/0.30 % CPUTime :
% 5.44/2.34 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 5.44/2.34
% 5.44/2.34 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------