TSTP Solution File: SWC014+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SWC014+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/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 : n002.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:00:44 EDT 2023
% Result : Theorem 15.00s 4.67s
% Output : CNFRefutation 15.07s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 86
% Syntax : Number of formulae : 163 ( 48 unt; 77 typ; 0 def)
% Number of atoms : 175 ( 66 equ)
% Maximal formula atoms : 19 ( 2 avg)
% Number of connectives : 166 ( 77 ~; 60 |; 8 &)
% ( 1 <=>; 20 =>; 0 <=; 0 <~>)
% Maximal formula depth : 22 ( 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 : 58 ( 58 usr; 9 con; 0-2 aty)
% Number of variables : 37 (; 33 !; 4 ?; 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_52 > #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_53 > #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_52',type,
'#skF_52': $i ).
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_53',type,
'#skF_53': $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_1028,negated_conjecture,
~ ! [U] :
( ssList(U)
=> ! [V] :
( ssList(V)
=> ! [W] :
( ssList(W)
=> ! [X] :
( ssList(X)
=> ( ( V != X )
| ( U != W )
| ( ( ~ neq(V,nil)
| ? [Y] :
( ssList(Y)
& ( V = Y )
& ? [Z] :
( ssList(Z)
& ( tl(V) = Z )
& ( app(U,Z) = Y )
& neq(nil,V) ) )
| ! [X1] :
( ssItem(X1)
=> ! [X2] :
( ssList(X2)
=> ( ( cons(X1,nil) != W )
| ( app(cons(X1,nil),X2) != X ) ) ) ) )
& ( ~ neq(V,nil)
| neq(X,nil) ) ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
tff(f_385,axiom,
! [U] :
( ssList(U)
=> ( ( nil != U )
=> ssList(tl(U)) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax24) ).
tff(f_779,axiom,
! [U] :
( ssList(U)
=> ( ( nil != U )
=> ? [V] :
( ssList(V)
& ( tl(U) = V ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax76) ).
tff(f_769,axiom,
! [U] :
( ssList(U)
=> ( ( nil != U )
=> ? [V] :
( ssItem(V)
& ( hd(U) = V ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax75) ).
tff(f_311,axiom,
! [U] :
( ssList(U)
=> ! [V] :
( ssList(V)
=> ( neq(U,V)
<=> ( U != V ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax15) ).
tff(f_319,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax17) ).
tff(f_399,axiom,
! [U] :
( ssList(U)
=> ! [V] :
( ssList(V)
=> ssList(app(U,V)) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax26) ).
tff(f_834,axiom,
! [U] :
( ssList(U)
=> ! [V] :
( ssItem(V)
=> ( cons(V,U) = app(cons(V,nil),U) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax81) ).
tff(f_392,axiom,
! [U] :
( ssList(U)
=> ! [V] :
( ssItem(V)
=> ( tl(cons(V,U)) = U ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax25) ).
tff(c_388,plain,
ssList('#skF_51'),
inference(cnfTransformation,[status(thm)],[f_1028]) ).
tff(c_16089,plain,
! [U_1903] :
( ssList(tl(U_1903))
| ( nil = U_1903 )
| ~ ssList(U_1903) ),
inference(cnfTransformation,[status(thm)],[f_385]) ).
tff(c_386,plain,
'#skF_49' = '#skF_51',
inference(cnfTransformation,[status(thm)],[f_1028]) ).
tff(c_418,plain,
neq('#skF_49',nil),
inference(cnfTransformation,[status(thm)],[f_1028]) ).
tff(c_426,plain,
neq('#skF_51',nil),
inference(demodulation,[status(thm),theory(equality)],[c_386,c_418]) ).
tff(c_398,plain,
( ( cons('#skF_52',nil) = '#skF_50' )
| ~ neq('#skF_51',nil) ),
inference(cnfTransformation,[status(thm)],[f_1028]) ).
tff(c_434,plain,
cons('#skF_52',nil) = '#skF_50',
inference(demodulation,[status(thm),theory(equality)],[c_426,c_398]) ).
tff(c_396,plain,
( ( app(cons('#skF_52',nil),'#skF_53') = '#skF_51' )
| ~ neq('#skF_51',nil) ),
inference(cnfTransformation,[status(thm)],[f_1028]) ).
tff(c_436,plain,
app(cons('#skF_52',nil),'#skF_53') = '#skF_51',
inference(demodulation,[status(thm),theory(equality)],[c_426,c_396]) ).
tff(c_439,plain,
app('#skF_50','#skF_53') = '#skF_51',
inference(demodulation,[status(thm),theory(equality)],[c_434,c_436]) ).
tff(c_400,plain,
( ssList('#skF_53')
| ~ neq('#skF_51',nil) ),
inference(cnfTransformation,[status(thm)],[f_1028]) ).
tff(c_432,plain,
ssList('#skF_53'),
inference(demodulation,[status(thm),theory(equality)],[c_426,c_400]) ).
tff(c_402,plain,
( ssItem('#skF_52')
| ~ neq('#skF_51',nil) ),
inference(cnfTransformation,[status(thm)],[f_1028]) ).
tff(c_430,plain,
ssItem('#skF_52'),
inference(demodulation,[status(thm),theory(equality)],[c_426,c_402]) ).
tff(c_6196,plain,
! [U_1524] :
( ( tl(U_1524) = '#skF_47'(U_1524) )
| ( nil = U_1524 )
| ~ ssList(U_1524) ),
inference(cnfTransformation,[status(thm)],[f_779]) ).
tff(c_6316,plain,
( ( tl('#skF_51') = '#skF_47'('#skF_51') )
| ( nil = '#skF_51' ) ),
inference(resolution,[status(thm)],[c_388,c_6196]) ).
tff(c_7417,plain,
nil = '#skF_51',
inference(splitLeft,[status(thm)],[c_6316]) ).
tff(c_3539,plain,
! [U_1398] :
( ( hd(U_1398) = '#skF_46'(U_1398) )
| ( nil = U_1398 )
| ~ ssList(U_1398) ),
inference(cnfTransformation,[status(thm)],[f_769]) ).
tff(c_3651,plain,
( ( hd('#skF_51') = '#skF_46'('#skF_51') )
| ( nil = '#skF_51' ) ),
inference(resolution,[status(thm)],[c_388,c_3539]) ).
tff(c_3655,plain,
nil = '#skF_51',
inference(splitLeft,[status(thm)],[c_3651]) ).
tff(c_3691,plain,
neq('#skF_51','#skF_51'),
inference(demodulation,[status(thm),theory(equality)],[c_3655,c_426]) ).
tff(c_164,plain,
! [V_858] :
( ~ neq(V_858,V_858)
| ~ ssList(V_858) ),
inference(cnfTransformation,[status(thm)],[f_311]) ).
tff(c_3719,plain,
~ ssList('#skF_51'),
inference(resolution,[status(thm)],[c_3691,c_164]) ).
tff(c_3726,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_388,c_3719]) ).
tff(c_3728,plain,
nil != '#skF_51',
inference(splitRight,[status(thm)],[c_3651]) ).
tff(c_168,plain,
ssList(nil),
inference(cnfTransformation,[status(thm)],[f_319]) ).
tff(c_5455,plain,
! [U_1462,V_1463] :
( neq(U_1462,V_1463)
| ( V_1463 = U_1462 )
| ~ ssList(V_1463)
| ~ ssList(U_1462) ),
inference(cnfTransformation,[status(thm)],[f_311]) ).
tff(c_853,plain,
! [U_1292] :
( ( hd(U_1292) = '#skF_46'(U_1292) )
| ( nil = U_1292 )
| ~ ssList(U_1292) ),
inference(cnfTransformation,[status(thm)],[f_769]) ).
tff(c_961,plain,
( ( hd('#skF_51') = '#skF_46'('#skF_51') )
| ( nil = '#skF_51' ) ),
inference(resolution,[status(thm)],[c_388,c_853]) ).
tff(c_2672,plain,
nil = '#skF_51',
inference(splitLeft,[status(thm)],[c_961]) ).
tff(c_2706,plain,
neq('#skF_51','#skF_51'),
inference(demodulation,[status(thm),theory(equality)],[c_2672,c_426]) ).
tff(c_2921,plain,
~ ssList('#skF_51'),
inference(resolution,[status(thm)],[c_2706,c_164]) ).
tff(c_2928,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_388,c_2921]) ).
tff(c_2930,plain,
nil != '#skF_51',
inference(splitRight,[status(thm)],[c_961]) ).
tff(c_188,plain,
! [U_892] :
( ssList(tl(U_892))
| ( nil = U_892 )
| ~ ssList(U_892) ),
inference(cnfTransformation,[status(thm)],[f_385]) ).
tff(c_390,plain,
ssList('#skF_50'),
inference(cnfTransformation,[status(thm)],[f_1028]) ).
tff(c_2946,plain,
! [U_1336,V_1337] :
( ssList(app(U_1336,V_1337))
| ~ ssList(V_1337)
| ~ ssList(U_1336) ),
inference(cnfTransformation,[status(thm)],[f_399]) ).
tff(c_384,plain,
'#skF_48' = '#skF_50',
inference(cnfTransformation,[status(thm)],[f_1028]) ).
tff(c_404,plain,
( ~ neq(nil,'#skF_49')
| ~ ssList(tl('#skF_49'))
| ( app('#skF_48',tl('#skF_49')) != '#skF_49' )
| ~ ssList(app('#skF_48',tl('#skF_49')))
| ~ neq('#skF_51',nil) ),
inference(cnfTransformation,[status(thm)],[f_1028]) ).
tff(c_427,plain,
( ~ neq(nil,'#skF_51')
| ~ ssList(tl('#skF_51'))
| ( app('#skF_48',tl('#skF_51')) != '#skF_51' )
| ~ ssList(app('#skF_48',tl('#skF_51')))
| ~ neq('#skF_51',nil) ),
inference(demodulation,[status(thm),theory(equality)],[c_386,c_386,c_386,c_386,c_386,c_404]) ).
tff(c_438,plain,
( ~ neq(nil,'#skF_51')
| ~ ssList(tl('#skF_51'))
| ( app('#skF_48',tl('#skF_51')) != '#skF_51' )
| ~ ssList(app('#skF_48',tl('#skF_51'))) ),
inference(demodulation,[status(thm),theory(equality)],[c_426,c_427]) ).
tff(c_441,plain,
( ~ neq(nil,'#skF_51')
| ~ ssList(tl('#skF_51'))
| ( app('#skF_50',tl('#skF_51')) != '#skF_51' )
| ~ ssList(app('#skF_50',tl('#skF_51'))) ),
inference(demodulation,[status(thm),theory(equality)],[c_384,c_384,c_438]) ).
tff(c_467,plain,
~ ssList(app('#skF_50',tl('#skF_51'))),
inference(splitLeft,[status(thm)],[c_441]) ).
tff(c_2958,plain,
( ~ ssList(tl('#skF_51'))
| ~ ssList('#skF_50') ),
inference(resolution,[status(thm)],[c_2946,c_467]) ).
tff(c_2988,plain,
~ ssList(tl('#skF_51')),
inference(demodulation,[status(thm),theory(equality)],[c_390,c_2958]) ).
tff(c_3007,plain,
( ( nil = '#skF_51' )
| ~ ssList('#skF_51') ),
inference(resolution,[status(thm)],[c_188,c_2988]) ).
tff(c_3010,plain,
nil = '#skF_51',
inference(demodulation,[status(thm),theory(equality)],[c_388,c_3007]) ).
tff(c_3012,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_2930,c_3010]) ).
tff(c_3013,plain,
( ( app('#skF_50',tl('#skF_51')) != '#skF_51' )
| ~ ssList(tl('#skF_51'))
| ~ neq(nil,'#skF_51') ),
inference(splitRight,[status(thm)],[c_441]) ).
tff(c_3018,plain,
~ neq(nil,'#skF_51'),
inference(splitLeft,[status(thm)],[c_3013]) ).
tff(c_5458,plain,
( ( nil = '#skF_51' )
| ~ ssList('#skF_51')
| ~ ssList(nil) ),
inference(resolution,[status(thm)],[c_5455,c_3018]) ).
tff(c_5469,plain,
nil = '#skF_51',
inference(demodulation,[status(thm),theory(equality)],[c_168,c_388,c_5458]) ).
tff(c_5471,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_3728,c_5469]) ).
tff(c_5473,plain,
neq(nil,'#skF_51'),
inference(splitRight,[status(thm)],[c_3013]) ).
tff(c_7576,plain,
neq('#skF_51','#skF_51'),
inference(demodulation,[status(thm),theory(equality)],[c_7417,c_5473]) ).
tff(c_7603,plain,
~ ssList('#skF_51'),
inference(resolution,[status(thm)],[c_7576,c_164]) ).
tff(c_7610,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_388,c_7603]) ).
tff(c_7611,plain,
tl('#skF_51') = '#skF_47'('#skF_51'),
inference(splitRight,[status(thm)],[c_6316]) ).
tff(c_15410,plain,
! [V_1876,U_1877] :
( ( app(cons(V_1876,nil),U_1877) = cons(V_1876,U_1877) )
| ~ ssItem(V_1876)
| ~ ssList(U_1877) ),
inference(cnfTransformation,[status(thm)],[f_834]) ).
tff(c_15429,plain,
! [U_1877] :
( ( cons('#skF_52',U_1877) = app('#skF_50',U_1877) )
| ~ ssItem('#skF_52')
| ~ ssList(U_1877) ),
inference(superposition,[status(thm),theory(equality)],[c_434,c_15410]) ).
tff(c_15608,plain,
! [U_1879] :
( ( cons('#skF_52',U_1879) = app('#skF_50',U_1879) )
| ~ ssList(U_1879) ),
inference(demodulation,[status(thm),theory(equality)],[c_430,c_15429]) ).
tff(c_15722,plain,
cons('#skF_52','#skF_53') = app('#skF_50','#skF_53'),
inference(resolution,[status(thm)],[c_432,c_15608]) ).
tff(c_15770,plain,
cons('#skF_52','#skF_53') = '#skF_51',
inference(demodulation,[status(thm),theory(equality)],[c_439,c_15722]) ).
tff(c_190,plain,
! [V_895,U_893] :
( ( tl(cons(V_895,U_893)) = U_893 )
| ~ ssItem(V_895)
| ~ ssList(U_893) ),
inference(cnfTransformation,[status(thm)],[f_392]) ).
tff(c_15784,plain,
( ( tl('#skF_51') = '#skF_53' )
| ~ ssItem('#skF_52')
| ~ ssList('#skF_53') ),
inference(superposition,[status(thm),theory(equality)],[c_15770,c_190]) ).
tff(c_15799,plain,
'#skF_47'('#skF_51') = '#skF_53',
inference(demodulation,[status(thm),theory(equality)],[c_432,c_430,c_7611,c_15784]) ).
tff(c_5472,plain,
( ~ ssList(tl('#skF_51'))
| ( app('#skF_50',tl('#skF_51')) != '#skF_51' ) ),
inference(splitRight,[status(thm)],[c_3013]) ).
tff(c_5493,plain,
app('#skF_50',tl('#skF_51')) != '#skF_51',
inference(splitLeft,[status(thm)],[c_5472]) ).
tff(c_7859,plain,
app('#skF_50','#skF_47'('#skF_51')) != '#skF_51',
inference(demodulation,[status(thm),theory(equality)],[c_7611,c_5493]) ).
tff(c_15864,plain,
app('#skF_50','#skF_53') != '#skF_51',
inference(demodulation,[status(thm),theory(equality)],[c_15799,c_7859]) ).
tff(c_15888,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_439,c_15864]) ).
tff(c_15889,plain,
~ ssList(tl('#skF_51')),
inference(splitRight,[status(thm)],[c_5472]) ).
tff(c_16098,plain,
( ( nil = '#skF_51' )
| ~ ssList('#skF_51') ),
inference(resolution,[status(thm)],[c_16089,c_15889]) ).
tff(c_16103,plain,
nil = '#skF_51',
inference(demodulation,[status(thm),theory(equality)],[c_388,c_16098]) ).
tff(c_16132,plain,
neq('#skF_51','#skF_51'),
inference(demodulation,[status(thm),theory(equality)],[c_16103,c_426]) ).
tff(c_16151,plain,
~ ssList('#skF_51'),
inference(resolution,[status(thm)],[c_16132,c_164]) ).
tff(c_16158,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_388,c_16151]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.14 % Problem : SWC014+1 : TPTP v8.1.2. Released v2.4.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.14/0.36 % Computer : n002.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.21/0.36 % CPULimit : 300
% 0.21/0.36 % WCLimit : 300
% 0.21/0.36 % DateTime : Thu Aug 3 22:00:16 EDT 2023
% 0.21/0.36 % CPUTime :
% 15.00/4.67 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 15.00/4.68
% 15.00/4.68 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 15.07/4.71
% 15.07/4.71 Inference rules
% 15.07/4.71 ----------------------
% 15.07/4.71 #Ref : 0
% 15.07/4.71 #Sup : 3454
% 15.07/4.71 #Fact : 0
% 15.07/4.71 #Define : 0
% 15.07/4.71 #Split : 67
% 15.07/4.71 #Chain : 0
% 15.07/4.71 #Close : 0
% 15.07/4.71
% 15.07/4.71 Ordering : KBO
% 15.07/4.71
% 15.07/4.71 Simplification rules
% 15.07/4.71 ----------------------
% 15.07/4.71 #Subsume : 296
% 15.07/4.71 #Demod : 2642
% 15.07/4.71 #Tautology : 1421
% 15.07/4.71 #SimpNegUnit : 208
% 15.07/4.71 #BackRed : 589
% 15.07/4.71
% 15.07/4.71 #Partial instantiations: 0
% 15.07/4.71 #Strategies tried : 1
% 15.07/4.71
% 15.07/4.71 Timing (in seconds)
% 15.07/4.71 ----------------------
% 15.07/4.72 Preprocessing : 0.87
% 15.07/4.72 Parsing : 0.40
% 15.07/4.72 CNF conversion : 0.11
% 15.07/4.72 Main loop : 2.67
% 15.07/4.72 Inferencing : 0.86
% 15.07/4.72 Reduction : 0.94
% 15.07/4.72 Demodulation : 0.68
% 15.07/4.72 BG Simplification : 0.11
% 15.07/4.72 Subsumption : 0.54
% 15.07/4.72 Abstraction : 0.08
% 15.07/4.72 MUC search : 0.00
% 15.07/4.72 Cooper : 0.00
% 15.07/4.72 Total : 3.60
% 15.07/4.72 Index Insertion : 0.00
% 15.07/4.72 Index Deletion : 0.00
% 15.07/4.72 Index Matching : 0.00
% 15.07/4.72 BG Taut test : 0.00
%------------------------------------------------------------------------------