%------------------------------------------------------------------------------
% File : Beagle---0.9.52
% Problem : SWC023-1 : TPTP v9.0.0. Released v2.4.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 : n003.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 09:18:56 PM UTC 2025
% Result : Unsatisfiable 9.61s 3.19s
% Output : CNFRefutation 10.02s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 11
% Syntax : Number of formulae : 53 ( 30 unt; 0 typ; 0 def)
% Number of atoms : 83 ( 25 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 56 ( 26 ~; 30 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 2 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 : 21 ( 19 usr; 1 prp; 0-2 aty)
% Number of functors : 54 ( 54 usr; 8 con; 0-2 aty)
% Number of variables : 7 ( 7 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ segmentP > rearsegP > neq > memberP > lt > leq > gt > geq > frontsegP > totalorderedP > totalorderP > strictorderedP > strictorderP > ssList > ssItem > singletonP > equalelemsP > duplicatefreeP > cyclefreeP > skaf48 > skaf47 > skaf46 > skaf45 > skaf43 > skaf42 > cons > app > #nlpp > tl > skaf83 > skaf82 > skaf81 > skaf80 > skaf79 > skaf78 > skaf77 > skaf76 > skaf75 > skaf74 > skaf73 > skaf72 > skaf71 > skaf70 > skaf69 > skaf68 > skaf67 > skaf66 > skaf65 > skaf64 > skaf63 > skaf62 > skaf61 > skaf60 > skaf59 > skaf58 > skaf57 > skaf56 > skaf55 > skaf54 > skaf53 > skaf52 > skaf51 > skaf50 > skaf49 > skaf44 > hd > skac3 > skac2 > sk5 > sk4 > sk3 > sk2 > sk1 > nil
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(skaf56,type,
skaf56: $i > $i ).
tff(segmentP,type,
segmentP: ( $i * $i ) > $o ).
tff(totalorderedP,type,
totalorderedP: $i > $o ).
tff(equalelemsP,type,
equalelemsP: $i > $o ).
tff(skaf74,type,
skaf74: $i > $i ).
tff(skaf61,type,
skaf61: $i > $i ).
tff(skaf51,type,
skaf51: $i > $i ).
tff(skaf83,type,
skaf83: $i > $i ).
tff(skac2,type,
skac2: $i ).
tff(skaf63,type,
skaf63: $i > $i ).
tff(skaf62,type,
skaf62: $i > $i ).
tff(sk2,type,
sk2: $i ).
tff(skaf52,type,
skaf52: $i > $i ).
tff(skaf50,type,
skaf50: $i > $i ).
tff(skaf42,type,
skaf42: ( $i * $i ) > $i ).
tff(skaf44,type,
skaf44: $i > $i ).
tff(singletonP,type,
singletonP: $i > $o ).
tff(skaf67,type,
skaf67: $i > $i ).
tff(skaf75,type,
skaf75: $i > $i ).
tff(sk1,type,
sk1: $i ).
tff(skaf58,type,
skaf58: $i > $i ).
tff(skaf46,type,
skaf46: ( $i * $i ) > $i ).
tff(frontsegP,type,
frontsegP: ( $i * $i ) > $o ).
tff(skaf70,type,
skaf70: $i > $i ).
tff(totalorderP,type,
totalorderP: $i > $o ).
tff(ssItem,type,
ssItem: $i > $o ).
tff(skaf82,type,
skaf82: $i > $i ).
tff(skaf47,type,
skaf47: ( $i * $i ) > $i ).
tff(skaf76,type,
skaf76: $i > $i ).
tff(skac3,type,
skac3: $i ).
tff(skaf80,type,
skaf80: $i > $i ).
tff(skaf59,type,
skaf59: $i > $i ).
tff(skaf53,type,
skaf53: $i > $i ).
tff(skaf45,type,
skaf45: ( $i * $i ) > $i ).
tff(hd,type,
hd: $i > $i ).
tff(app,type,
app: ( $i * $i ) > $i ).
tff(skaf72,type,
skaf72: $i > $i ).
tff(duplicatefreeP,type,
duplicatefreeP: $i > $o ).
tff(skaf64,type,
skaf64: $i > $i ).
tff(sk4,type,
sk4: $i ).
tff(gt,type,
gt: ( $i * $i ) > $o ).
tff(skaf71,type,
skaf71: $i > $i ).
tff(skaf78,type,
skaf78: $i > $i ).
tff(sk5,type,
sk5: $i ).
tff(skaf79,type,
skaf79: $i > $i ).
tff(rearsegP,type,
rearsegP: ( $i * $i ) > $o ).
tff(memberP,type,
memberP: ( $i * $i ) > $o ).
tff(skaf73,type,
skaf73: $i > $i ).
tff(ssList,type,
ssList: $i > $o ).
tff(cons,type,
cons: ( $i * $i ) > $i ).
tff(skaf54,type,
skaf54: $i > $i ).
tff(skaf77,type,
skaf77: $i > $i ).
tff(sk3,type,
sk3: $i ).
tff(skaf66,type,
skaf66: $i > $i ).
tff(strictorderP,type,
strictorderP: $i > $o ).
tff(skaf81,type,
skaf81: $i > $i ).
tff(geq,type,
geq: ( $i * $i ) > $o ).
tff(skaf60,type,
skaf60: $i > $i ).
tff(leq,type,
leq: ( $i * $i ) > $o ).
tff(lt,type,
lt: ( $i * $i ) > $o ).
tff(skaf69,type,
skaf69: $i > $i ).
tff(tl,type,
tl: $i > $i ).
tff(neq,type,
neq: ( $i * $i ) > $o ).
tff(skaf43,type,
skaf43: ( $i * $i ) > $i ).
tff(skaf48,type,
skaf48: ( $i * $i ) > $i ).
tff(skaf65,type,
skaf65: $i > $i ).
tff(skaf57,type,
skaf57: $i > $i ).
tff(nil,type,
nil: $i ).
tff(skaf49,type,
skaf49: $i > $i ).
tff(skaf55,type,
skaf55: $i > $i ).
tff(skaf68,type,
skaf68: $i > $i ).
tff(strictorderedP,type,
strictorderedP: $i > $o ).
tff(cyclefreeP,type,
cyclefreeP: $i > $o ).
tff(f_56,axiom,
ssList(nil),
file(unknown,unknown) ).
tff(f_1650,axiom,
sk1 = sk3,
file(unknown,unknown) ).
tff(f_1669,axiom,
( ssList(sk5)
| ( nil = sk3 ) ),
file(unknown,unknown) ).
tff(f_1649,axiom,
sk2 = sk4,
file(unknown,unknown) ).
tff(f_1675,axiom,
( frontsegP(sk4,sk5)
| ( nil = sk4 ) ),
file(unknown,unknown) ).
tff(f_1678,axiom,
( frontsegP(sk3,sk5)
| ( nil = sk4 ) ),
file(unknown,unknown) ).
tff(f_1672,axiom,
( neq(sk5,nil)
| ( nil = sk4 ) ),
file(unknown,unknown) ).
tff(f_1663,axiom,
! [A] :
( ~ ssList(A)
| ~ neq(A,nil)
| ~ frontsegP(sk2,A)
| ~ frontsegP(sk1,A) ),
file(unknown,unknown) ).
tff(f_1651,axiom,
neq(sk2,nil),
file(unknown,unknown) ).
tff(f_613,axiom,
! [U,V] :
( ( U != V )
| ~ neq(U,V)
| ~ ssList(V)
| ~ ssList(U) ),
file(unknown,unknown) ).
tff(f_1666,axiom,
( ssList(sk5)
| ( nil = sk4 ) ),
file(unknown,unknown) ).
tff(c_16,plain,
ssList(nil),
inference(cnfTransformation,[status(thm)],[f_56]) ).
tff(c_382,plain,
sk3 = sk1,
inference(cnfTransformation,[status(thm)],[f_1650]) ).
tff(c_390,plain,
( ( sk3 = nil )
| ssList(sk5) ),
inference(cnfTransformation,[status(thm)],[f_1669]) ).
tff(c_403,plain,
( ( sk1 = nil )
| ssList(sk5) ),
inference(demodulation,[status(thm),theory(equality)],[c_382,c_390]) ).
tff(c_461,plain,
ssList(sk5),
inference(splitLeft,[status(thm)],[c_403]) ).
tff(c_380,plain,
sk4 = sk2,
inference(cnfTransformation,[status(thm)],[f_1649]) ).
tff(c_394,plain,
( ( sk4 = nil )
| frontsegP(sk4,sk5) ),
inference(cnfTransformation,[status(thm)],[f_1675]) ).
tff(c_409,plain,
( ( sk2 = nil )
| frontsegP(sk2,sk5) ),
inference(demodulation,[status(thm),theory(equality)],[c_380,c_380,c_394]) ).
tff(c_475,plain,
frontsegP(sk2,sk5),
inference(splitLeft,[status(thm)],[c_409]) ).
tff(c_396,plain,
( ( sk4 = nil )
| frontsegP(sk3,sk5) ),
inference(cnfTransformation,[status(thm)],[f_1678]) ).
tff(c_407,plain,
( ( sk4 = nil )
| frontsegP(sk1,sk5) ),
inference(demodulation,[status(thm),theory(equality)],[c_382,c_396]) ).
tff(c_412,plain,
( ( sk2 = nil )
| frontsegP(sk1,sk5) ),
inference(demodulation,[status(thm),theory(equality)],[c_380,c_407]) ).
tff(c_483,plain,
frontsegP(sk1,sk5),
inference(splitLeft,[status(thm)],[c_412]) ).
tff(c_392,plain,
( ( sk4 = nil )
| neq(sk5,nil) ),
inference(cnfTransformation,[status(thm)],[f_1672]) ).
tff(c_410,plain,
( ( sk2 = nil )
| neq(sk5,nil) ),
inference(demodulation,[status(thm),theory(equality)],[c_380,c_392]) ).
tff(c_480,plain,
neq(sk5,nil),
inference(splitLeft,[status(thm)],[c_410]) ).
tff(c_3174,plain,
! [A_601] :
( ~ frontsegP(sk1,A_601)
| ~ frontsegP(sk2,A_601)
| ~ neq(A_601,nil)
| ~ ssList(A_601) ),
inference(cnfTransformation,[status(thm)],[f_1663]) ).
tff(c_3185,plain,
( ~ frontsegP(sk1,sk5)
| ~ frontsegP(sk2,sk5)
| ~ ssList(sk5) ),
inference(resolution,[status(thm)],[c_480,c_3174]) ).
tff(c_3196,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_461,c_475,c_483,c_3185]) ).
tff(c_3197,plain,
sk2 = nil,
inference(splitRight,[status(thm)],[c_412]) ).
tff(c_384,plain,
neq(sk2,nil),
inference(cnfTransformation,[status(thm)],[f_1651]) ).
tff(c_3200,plain,
neq(nil,nil),
inference(demodulation,[status(thm),theory(equality)],[c_3197,c_384]) ).
tff(c_230,plain,
! [V_129] :
( ~ ssList(V_129)
| ~ neq(V_129,V_129) ),
inference(cnfTransformation,[status(thm)],[f_613]) ).
tff(c_3215,plain,
~ ssList(nil),
inference(resolution,[status(thm)],[c_3200,c_230]) ).
tff(c_3222,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_16,c_3215]) ).
tff(c_3223,plain,
sk2 = nil,
inference(splitRight,[status(thm)],[c_410]) ).
tff(c_3226,plain,
neq(nil,nil),
inference(demodulation,[status(thm),theory(equality)],[c_3223,c_384]) ).
tff(c_3240,plain,
~ ssList(nil),
inference(resolution,[status(thm)],[c_3226,c_230]) ).
tff(c_3247,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_16,c_3240]) ).
tff(c_3248,plain,
sk2 = nil,
inference(splitRight,[status(thm)],[c_409]) ).
tff(c_3250,plain,
neq(nil,nil),
inference(demodulation,[status(thm),theory(equality)],[c_3248,c_384]) ).
tff(c_3275,plain,
! [V_608] :
( ~ ssList(V_608)
| ~ neq(V_608,V_608) ),
inference(cnfTransformation,[status(thm)],[f_613]) ).
tff(c_3278,plain,
~ ssList(nil),
inference(resolution,[status(thm)],[c_3250,c_3275]) ).
tff(c_3282,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_16,c_3278]) ).
tff(c_3284,plain,
~ ssList(sk5),
inference(splitRight,[status(thm)],[c_403]) ).
tff(c_388,plain,
( ( sk4 = nil )
| ssList(sk5) ),
inference(cnfTransformation,[status(thm)],[f_1666]) ).
tff(c_408,plain,
( ( sk2 = nil )
| ssList(sk5) ),
inference(demodulation,[status(thm),theory(equality)],[c_380,c_388]) ).
tff(c_3297,plain,
sk2 = nil,
inference(negUnitSimplification,[status(thm)],[c_3284,c_408]) ).
tff(c_3298,plain,
neq(nil,nil),
inference(demodulation,[status(thm),theory(equality)],[c_3297,c_384]) ).
tff(c_3329,plain,
! [V_631] :
( ~ ssList(V_631)
| ~ neq(V_631,V_631) ),
inference(cnfTransformation,[status(thm)],[f_613]) ).
tff(c_3332,plain,
~ ssList(nil),
inference(resolution,[status(thm)],[c_3298,c_3329]) ).
tff(c_3336,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_16,c_3332]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10 % Problem : SWC023-1 : TPTP v9.0.0. Released v2.4.0.
% 0.10/0.11 % 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.10/0.32 % Computer : n003.cluster.edu
% 0.10/0.32 % Model : x86_64 x86_64
% 0.10/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.32 % Memory : 8042.1875MB
% 0.10/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.32 % CPULimit : 300
% 0.10/0.32 % WCLimit : 300
% 0.10/0.32 % DateTime : Wed Apr 9 01:19:18 EDT 2025
% 0.10/0.32 % CPUTime :
% 9.61/3.19 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 10.02/3.20
% 10.02/3.20 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------