TSTP Solution File: SWC332+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SWC332+1 : TPTP v8.1.2. Released v2.4.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 : 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 11:02:10 EDT 2023
% Result : Theorem 9.08s 3.19s
% Output : CNFRefutation 9.08s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 83
% Syntax : Number of formulae : 123 ( 25 unt; 75 typ; 0 def)
% Number of atoms : 98 ( 29 equ)
% Maximal formula atoms : 11 ( 2 avg)
% Number of connectives : 85 ( 35 ~; 32 |; 4 &)
% ( 3 <=>; 11 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 85 ( 68 >; 17 *; 0 +; 0 <<)
% Number of predicates : 21 ( 19 usr; 1 prp; 0-2 aty)
% Number of functors : 56 ( 56 usr; 7 con; 0-2 aty)
% Number of variables : 22 (; 20 !; 2 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ segmentP > rearsegP > neq > memberP > lt > leq > gt > geq > frontsegP > totalorderedP > totalorderP > strictorderedP > strictorderP > ssList > ssItem > singletonP > equalelemsP > duplicatefreeP > cyclefreeP > cons > app > #nlpp > tl > hd > nil > #skF_36 > #skF_25 > #skF_5 > #skF_44 > #skF_21 > #skF_16 > #skF_6 > #skF_49 > #skF_18 > #skF_24 > #skF_35 > #skF_19 > #skF_31 > #skF_22 > #skF_37 > #skF_40 > #skF_48 > #skF_3 > #skF_34 > #skF_29 > #skF_15 > #skF_32 > #skF_51 > #skF_28 > #skF_10 > #skF_41 > #skF_2 > #skF_38 > #skF_43 > #skF_1 > #skF_8 > #skF_39 > #skF_23 > #skF_33 > #skF_26 > #skF_50 > #skF_13 > #skF_17 > #skF_11 > #skF_14 > #skF_27 > #skF_12 > #skF_7 > #skF_46 > #skF_42 > #skF_45 > #skF_9 > #skF_30 > #skF_4 > #skF_20 > #skF_47
%Foreground sorts:
%Background operators:
%Foreground operators:
tff('#skF_36',type,
'#skF_36': $i > $i ).
tff(segmentP,type,
segmentP: ( $i * $i ) > $o ).
tff('#skF_25',type,
'#skF_25': $i > $i ).
tff(totalorderedP,type,
totalorderedP: $i > $o ).
tff('#skF_5',type,
'#skF_5': $i > $i ).
tff(equalelemsP,type,
equalelemsP: $i > $o ).
tff('#skF_44',type,
'#skF_44': $i > $i ).
tff('#skF_21',type,
'#skF_21': $i > $i ).
tff('#skF_16',type,
'#skF_16': $i > $i ).
tff('#skF_6',type,
'#skF_6': ( $i * $i ) > $i ).
tff('#skF_49',type,
'#skF_49': $i ).
tff('#skF_18',type,
'#skF_18': $i > $i ).
tff('#skF_24',type,
'#skF_24': $i > $i ).
tff('#skF_35',type,
'#skF_35': $i > $i ).
tff(singletonP,type,
singletonP: $i > $o ).
tff('#skF_19',type,
'#skF_19': $i > $i ).
tff('#skF_31',type,
'#skF_31': $i > $i ).
tff('#skF_22',type,
'#skF_22': $i > $i ).
tff(frontsegP,type,
frontsegP: ( $i * $i ) > $o ).
tff('#skF_37',type,
'#skF_37': $i > $i ).
tff(totalorderP,type,
totalorderP: $i > $o ).
tff(ssItem,type,
ssItem: $i > $o ).
tff('#skF_40',type,
'#skF_40': $i > $i ).
tff('#skF_48',type,
'#skF_48': $i ).
tff('#skF_3',type,
'#skF_3': ( $i * $i ) > $i ).
tff('#skF_34',type,
'#skF_34': $i > $i ).
tff('#skF_29',type,
'#skF_29': $i > $i ).
tff('#skF_15',type,
'#skF_15': $i > $i ).
tff('#skF_32',type,
'#skF_32': $i > $i ).
tff('#skF_51',type,
'#skF_51': $i ).
tff('#skF_28',type,
'#skF_28': $i > $i ).
tff('#skF_10',type,
'#skF_10': $i > $i ).
tff('#skF_41',type,
'#skF_41': $i > $i ).
tff('#skF_2',type,
'#skF_2': $i ).
tff('#skF_38',type,
'#skF_38': $i > $i ).
tff('#skF_43',type,
'#skF_43': $i > $i ).
tff(hd,type,
hd: $i > $i ).
tff(app,type,
app: ( $i * $i ) > $i ).
tff('#skF_1',type,
'#skF_1': $i ).
tff('#skF_8',type,
'#skF_8': ( $i * $i ) > $i ).
tff(duplicatefreeP,type,
duplicatefreeP: $i > $o ).
tff(gt,type,
gt: ( $i * $i ) > $o ).
tff('#skF_39',type,
'#skF_39': $i > $i ).
tff('#skF_23',type,
'#skF_23': $i > $i ).
tff(rearsegP,type,
rearsegP: ( $i * $i ) > $o ).
tff('#skF_33',type,
'#skF_33': $i > $i ).
tff(memberP,type,
memberP: ( $i * $i ) > $o ).
tff('#skF_26',type,
'#skF_26': $i > $i ).
tff('#skF_50',type,
'#skF_50': $i ).
tff('#skF_13',type,
'#skF_13': $i > $i ).
tff(ssList,type,
ssList: $i > $o ).
tff(cons,type,
cons: ( $i * $i ) > $i ).
tff(strictorderP,type,
strictorderP: $i > $o ).
tff('#skF_17',type,
'#skF_17': $i > $i ).
tff(geq,type,
geq: ( $i * $i ) > $o ).
tff('#skF_11',type,
'#skF_11': $i > $i ).
tff(leq,type,
leq: ( $i * $i ) > $o ).
tff('#skF_14',type,
'#skF_14': $i > $i ).
tff(lt,type,
lt: ( $i * $i ) > $o ).
tff(tl,type,
tl: $i > $i ).
tff(neq,type,
neq: ( $i * $i ) > $o ).
tff('#skF_27',type,
'#skF_27': $i > $i ).
tff('#skF_12',type,
'#skF_12': $i > $i ).
tff('#skF_7',type,
'#skF_7': ( $i * $i ) > $i ).
tff('#skF_46',type,
'#skF_46': $i > $i ).
tff(nil,type,
nil: $i ).
tff('#skF_42',type,
'#skF_42': $i > $i ).
tff('#skF_45',type,
'#skF_45': $i > $i ).
tff('#skF_9',type,
'#skF_9': ( $i * $i ) > $i ).
tff(strictorderedP,type,
strictorderedP: $i > $o ).
tff('#skF_30',type,
'#skF_30': $i > $i ).
tff('#skF_4',type,
'#skF_4': ( $i * $i ) > $i ).
tff('#skF_20',type,
'#skF_20': $i > $i ).
tff(cyclefreeP,type,
cyclefreeP: $i > $o ).
tff('#skF_47',type,
'#skF_47': $i > $i ).
tff(f_1006,negated_conjecture,
~ ! [U] :
( ssList(U)
=> ! [V] :
( ssList(V)
=> ! [W] :
( ssList(W)
=> ! [X] :
( ssList(X)
=> ( ( V != X )
| ( U != W )
| ~ segmentP(X,W)
| ( ~ singletonP(W)
& neq(X,nil) )
| ( segmentP(V,U)
& equalelemsP(U) ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
tff(f_769,axiom,
! [U] :
( ssList(U)
=> ( ( nil != U )
=> ? [V] :
( ssItem(V)
& ( hd(U) = V ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax75) ).
tff(f_759,axiom,
equalelemsP(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax74) ).
tff(f_692,axiom,
! [U] :
( ssList(U)
=> ( segmentP(nil,U)
<=> ( nil = U ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax58) ).
tff(f_319,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax17) ).
tff(f_311,axiom,
! [U] :
( ssList(U)
=> ! [V] :
( ssList(V)
=> ( neq(U,V)
<=> ( U != V ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax15) ).
tff(f_96,axiom,
! [U] :
( ssList(U)
=> ( singletonP(U)
<=> ? [V] :
( ssItem(V)
& ( cons(V,nil) = U ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax4) ).
tff(f_758,axiom,
! [U] :
( ssItem(U)
=> equalelemsP(cons(U,nil)) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax73) ).
tff(c_388,plain,
segmentP('#skF_51','#skF_50'),
inference(cnfTransformation,[status(thm)],[f_1006]) ).
tff(c_390,plain,
'#skF_48' = '#skF_50',
inference(cnfTransformation,[status(thm)],[f_1006]) ).
tff(c_392,plain,
'#skF_49' = '#skF_51',
inference(cnfTransformation,[status(thm)],[f_1006]) ).
tff(c_384,plain,
( ~ equalelemsP('#skF_48')
| ~ segmentP('#skF_49','#skF_48') ),
inference(cnfTransformation,[status(thm)],[f_1006]) ).
tff(c_406,plain,
~ equalelemsP('#skF_50'),
inference(demodulation,[status(thm),theory(equality)],[c_388,c_390,c_392,c_390,c_384]) ).
tff(c_394,plain,
ssList('#skF_51'),
inference(cnfTransformation,[status(thm)],[f_1006]) ).
tff(c_973,plain,
! [U_1200] :
( ( hd(U_1200) = '#skF_46'(U_1200) )
| ( nil = U_1200 )
| ~ ssList(U_1200) ),
inference(cnfTransformation,[status(thm)],[f_769]) ).
tff(c_1077,plain,
( ( hd('#skF_51') = '#skF_46'('#skF_51') )
| ( nil = '#skF_51' ) ),
inference(resolution,[status(thm)],[c_394,c_973]) ).
tff(c_1081,plain,
nil = '#skF_51',
inference(splitLeft,[status(thm)],[c_1077]) ).
tff(c_396,plain,
ssList('#skF_50'),
inference(cnfTransformation,[status(thm)],[f_1006]) ).
tff(c_1078,plain,
( ( hd('#skF_50') = '#skF_46'('#skF_50') )
| ( nil = '#skF_50' ) ),
inference(resolution,[status(thm)],[c_396,c_973]) ).
tff(c_1127,plain,
( ( hd('#skF_50') = '#skF_46'('#skF_50') )
| ( '#skF_51' = '#skF_50' ) ),
inference(demodulation,[status(thm),theory(equality)],[c_1081,c_1078]) ).
tff(c_1128,plain,
'#skF_51' = '#skF_50',
inference(splitLeft,[status(thm)],[c_1127]) ).
tff(c_328,plain,
equalelemsP(nil),
inference(cnfTransformation,[status(thm)],[f_759]) ).
tff(c_1119,plain,
equalelemsP('#skF_51'),
inference(demodulation,[status(thm),theory(equality)],[c_1081,c_328]) ).
tff(c_1131,plain,
equalelemsP('#skF_50'),
inference(demodulation,[status(thm),theory(equality)],[c_1128,c_1119]) ).
tff(c_1143,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_406,c_1131]) ).
tff(c_1145,plain,
'#skF_51' != '#skF_50',
inference(splitRight,[status(thm)],[c_1127]) ).
tff(c_278,plain,
! [U_1031] :
( ( nil = U_1031 )
| ~ segmentP(nil,U_1031)
| ~ ssList(U_1031) ),
inference(cnfTransformation,[status(thm)],[f_692]) ).
tff(c_1667,plain,
! [U_1235] :
( ( U_1235 = '#skF_51' )
| ~ segmentP('#skF_51',U_1235)
| ~ ssList(U_1235) ),
inference(demodulation,[status(thm),theory(equality)],[c_1081,c_1081,c_278]) ).
tff(c_1678,plain,
( ( '#skF_51' = '#skF_50' )
| ~ ssList('#skF_50') ),
inference(resolution,[status(thm)],[c_388,c_1667]) ).
tff(c_1689,plain,
'#skF_51' = '#skF_50',
inference(demodulation,[status(thm),theory(equality)],[c_396,c_1678]) ).
tff(c_1691,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_1145,c_1689]) ).
tff(c_1693,plain,
nil != '#skF_51',
inference(splitRight,[status(thm)],[c_1077]) ).
tff(c_168,plain,
ssList(nil),
inference(cnfTransformation,[status(thm)],[f_319]) ).
tff(c_2123,plain,
! [U_1252,V_1253] :
( neq(U_1252,V_1253)
| ( V_1253 = U_1252 )
| ~ ssList(V_1253)
| ~ ssList(U_1252) ),
inference(cnfTransformation,[status(thm)],[f_311]) ).
tff(c_386,plain,
( ~ neq('#skF_51',nil)
| singletonP('#skF_50') ),
inference(cnfTransformation,[status(thm)],[f_1006]) ).
tff(c_416,plain,
~ neq('#skF_51',nil),
inference(splitLeft,[status(thm)],[c_386]) ).
tff(c_2134,plain,
( ( nil = '#skF_51' )
| ~ ssList(nil)
| ~ ssList('#skF_51') ),
inference(resolution,[status(thm)],[c_2123,c_416]) ).
tff(c_2141,plain,
nil = '#skF_51',
inference(demodulation,[status(thm),theory(equality)],[c_394,c_168,c_2134]) ).
tff(c_2143,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_1693,c_2141]) ).
tff(c_2144,plain,
singletonP('#skF_50'),
inference(splitRight,[status(thm)],[c_386]) ).
tff(c_24,plain,
! [U_30] :
( ssItem('#skF_5'(U_30))
| ~ singletonP(U_30)
| ~ ssList(U_30) ),
inference(cnfTransformation,[status(thm)],[f_96]) ).
tff(c_3518,plain,
! [U_1347] :
( ( cons('#skF_5'(U_1347),nil) = U_1347 )
| ~ singletonP(U_1347)
| ~ ssList(U_1347) ),
inference(cnfTransformation,[status(thm)],[f_96]) ).
tff(c_326,plain,
! [U_1044] :
( equalelemsP(cons(U_1044,nil))
| ~ ssItem(U_1044) ),
inference(cnfTransformation,[status(thm)],[f_758]) ).
tff(c_3603,plain,
! [U_1353] :
( equalelemsP(U_1353)
| ~ ssItem('#skF_5'(U_1353))
| ~ singletonP(U_1353)
| ~ ssList(U_1353) ),
inference(superposition,[status(thm),theory(equality)],[c_3518,c_326]) ).
tff(c_3608,plain,
! [U_1354] :
( equalelemsP(U_1354)
| ~ singletonP(U_1354)
| ~ ssList(U_1354) ),
inference(resolution,[status(thm)],[c_24,c_3603]) ).
tff(c_3695,plain,
( equalelemsP('#skF_50')
| ~ singletonP('#skF_50') ),
inference(resolution,[status(thm)],[c_396,c_3608]) ).
tff(c_3727,plain,
equalelemsP('#skF_50'),
inference(demodulation,[status(thm),theory(equality)],[c_2144,c_3695]) ).
tff(c_3729,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_406,c_3727]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.14 % Problem : SWC332+1 : TPTP v8.1.2. Released v2.4.0.
% 0.00/0.14 % 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.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 : Thu Aug 3 21:49:24 EDT 2023
% 0.15/0.36 % CPUTime :
% 9.08/3.19 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 9.08/3.20
% 9.08/3.20 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 9.08/3.23
% 9.08/3.23 Inference rules
% 9.08/3.23 ----------------------
% 9.08/3.23 #Ref : 0
% 9.08/3.23 #Sup : 716
% 9.08/3.23 #Fact : 0
% 9.08/3.23 #Define : 0
% 9.08/3.23 #Split : 18
% 9.08/3.23 #Chain : 0
% 9.08/3.23 #Close : 0
% 9.08/3.23
% 9.08/3.23 Ordering : KBO
% 9.08/3.23
% 9.08/3.23 Simplification rules
% 9.08/3.23 ----------------------
% 9.08/3.23 #Subsume : 10
% 9.08/3.23 #Demod : 360
% 9.08/3.23 #Tautology : 175
% 9.08/3.23 #SimpNegUnit : 27
% 9.08/3.23 #BackRed : 184
% 9.08/3.23
% 9.08/3.23 #Partial instantiations: 0
% 9.08/3.23 #Strategies tried : 1
% 9.08/3.23
% 9.08/3.23 Timing (in seconds)
% 9.08/3.23 ----------------------
% 9.08/3.24 Preprocessing : 0.94
% 9.08/3.24 Parsing : 0.44
% 9.08/3.24 CNF conversion : 0.11
% 9.08/3.24 Main loop : 1.12
% 9.08/3.24 Inferencing : 0.41
% 9.08/3.24 Reduction : 0.32
% 9.08/3.24 Demodulation : 0.21
% 9.08/3.24 BG Simplification : 0.09
% 9.08/3.24 Subsumption : 0.21
% 9.08/3.24 Abstraction : 0.05
% 9.08/3.24 MUC search : 0.00
% 9.08/3.24 Cooper : 0.00
% 9.08/3.24 Total : 2.11
% 9.08/3.24 Index Insertion : 0.00
% 9.08/3.24 Index Deletion : 0.00
% 9.08/3.24 Index Matching : 0.00
% 9.08/3.24 BG Taut test : 0.00
%------------------------------------------------------------------------------