TSTP Solution File: SWC366+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SWC366+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 : n006.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:19 EDT 2023
% Result : Theorem 15.94s 5.26s
% Output : CNFRefutation 15.94s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 84
% Syntax : Number of formulae : 178 ( 57 unt; 75 typ; 0 def)
% Number of atoms : 207 ( 71 equ)
% Maximal formula atoms : 18 ( 2 avg)
% Number of connectives : 186 ( 82 ~; 73 |; 11 &)
% ( 2 <=>; 18 =>; 0 <=; 0 <~>)
% Maximal formula depth : 25 ( 3 avg)
% Maximal term depth : 4 ( 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 : 40 (; 34 !; 6 ?; 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_1024,negated_conjecture,
~ ! [U] :
( ssList(U)
=> ! [V] :
( ssList(V)
=> ! [W] :
( ssList(W)
=> ! [X] :
( ssList(X)
=> ( ( V != X )
| ( U != W )
| ( ( ~ neq(V,nil)
| ? [Y] :
( ssList(Y)
& ( X != Y )
& ? [Z] :
( ssList(Z)
& ( app(Z,W) = Y )
& ? [X1] :
( ssItem(X1)
& ( cons(X1,nil) = Z )
& ( hd(X) = X1 )
& neq(nil,X) ) ) )
| rearsegP(V,U) )
& ( ~ neq(V,nil)
| neq(X,nil) ) ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
tff(f_779,axiom,
! [U] :
( ssList(U)
=> ( ( nil != U )
=> ? [V] :
( ssList(V)
& ( tl(U) = V ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax76) ).
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_319,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax17) ).
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_371,axiom,
! [U] :
( ssList(U)
=> ( ( nil != U )
=> ssItem(hd(U)) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax22) ).
tff(f_318,axiom,
! [U] :
( ssList(U)
=> ! [V] :
( ssItem(V)
=> ssList(cons(V,U)) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax16) ).
tff(f_399,axiom,
! [U] :
( ssList(U)
=> ! [V] :
( ssList(V)
=> ssList(app(U,V)) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax26) ).
tff(f_120,axiom,
! [U] :
( ssList(U)
=> ! [V] :
( ssList(V)
=> ( rearsegP(U,V)
<=> ? [W] :
( ssList(W)
& ( app(W,V) = U ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax6) ).
tff(c_384,plain,
'#skF_48' = '#skF_50',
inference(cnfTransformation,[status(thm)],[f_1024]) ).
tff(c_386,plain,
'#skF_49' = '#skF_51',
inference(cnfTransformation,[status(thm)],[f_1024]) ).
tff(c_406,plain,
neq('#skF_49',nil),
inference(cnfTransformation,[status(thm)],[f_1024]) ).
tff(c_411,plain,
neq('#skF_51',nil),
inference(demodulation,[status(thm),theory(equality)],[c_386,c_406]) ).
tff(c_396,plain,
( ~ rearsegP('#skF_49','#skF_48')
| ~ neq('#skF_51',nil) ),
inference(cnfTransformation,[status(thm)],[f_1024]) ).
tff(c_412,plain,
( ~ rearsegP('#skF_51','#skF_48')
| ~ neq('#skF_51',nil) ),
inference(demodulation,[status(thm),theory(equality)],[c_386,c_396]) ).
tff(c_417,plain,
~ rearsegP('#skF_51','#skF_48'),
inference(demodulation,[status(thm),theory(equality)],[c_411,c_412]) ).
tff(c_419,plain,
~ rearsegP('#skF_51','#skF_50'),
inference(demodulation,[status(thm),theory(equality)],[c_384,c_417]) ).
tff(c_388,plain,
ssList('#skF_51'),
inference(cnfTransformation,[status(thm)],[f_1024]) ).
tff(c_4991,plain,
! [U_1564] :
( ( tl(U_1564) = '#skF_47'(U_1564) )
| ( nil = U_1564 )
| ~ ssList(U_1564) ),
inference(cnfTransformation,[status(thm)],[f_779]) ).
tff(c_5099,plain,
( ( tl('#skF_51') = '#skF_47'('#skF_51') )
| ( nil = '#skF_51' ) ),
inference(resolution,[status(thm)],[c_388,c_4991]) ).
tff(c_5101,plain,
nil = '#skF_51',
inference(splitLeft,[status(thm)],[c_5099]) ).
tff(c_2168,plain,
! [U_1396] :
( ( tl(U_1396) = '#skF_47'(U_1396) )
| ( nil = U_1396 )
| ~ ssList(U_1396) ),
inference(cnfTransformation,[status(thm)],[f_779]) ).
tff(c_2276,plain,
( ( tl('#skF_51') = '#skF_47'('#skF_51') )
| ( nil = '#skF_51' ) ),
inference(resolution,[status(thm)],[c_388,c_2168]) ).
tff(c_2278,plain,
nil = '#skF_51',
inference(splitLeft,[status(thm)],[c_2276]) ).
tff(c_2324,plain,
neq('#skF_51','#skF_51'),
inference(demodulation,[status(thm),theory(equality)],[c_2278,c_411]) ).
tff(c_164,plain,
! [V_858] :
( ~ neq(V_858,V_858)
| ~ ssList(V_858) ),
inference(cnfTransformation,[status(thm)],[f_311]) ).
tff(c_2386,plain,
~ ssList('#skF_51'),
inference(resolution,[status(thm)],[c_2324,c_164]) ).
tff(c_2391,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_388,c_2386]) ).
tff(c_2393,plain,
nil != '#skF_51',
inference(splitRight,[status(thm)],[c_2276]) ).
tff(c_168,plain,
ssList(nil),
inference(cnfTransformation,[status(thm)],[f_319]) ).
tff(c_3253,plain,
! [U_1426,V_1427] :
( neq(U_1426,V_1427)
| ( V_1427 = U_1426 )
| ~ ssList(V_1427)
| ~ ssList(U_1426) ),
inference(cnfTransformation,[status(thm)],[f_311]) ).
tff(c_893,plain,
! [U_1313] :
( ( tl(U_1313) = '#skF_47'(U_1313) )
| ( nil = U_1313 )
| ~ ssList(U_1313) ),
inference(cnfTransformation,[status(thm)],[f_779]) ).
tff(c_1001,plain,
( ( tl('#skF_51') = '#skF_47'('#skF_51') )
| ( nil = '#skF_51' ) ),
inference(resolution,[status(thm)],[c_388,c_893]) ).
tff(c_1003,plain,
nil = '#skF_51',
inference(splitLeft,[status(thm)],[c_1001]) ).
tff(c_1033,plain,
neq('#skF_51','#skF_51'),
inference(demodulation,[status(thm),theory(equality)],[c_1003,c_411]) ).
tff(c_1188,plain,
~ ssList('#skF_51'),
inference(resolution,[status(thm)],[c_1033,c_164]) ).
tff(c_1193,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_388,c_1188]) ).
tff(c_1195,plain,
nil != '#skF_51',
inference(splitRight,[status(thm)],[c_1001]) ).
tff(c_1581,plain,
! [U_1327] :
( ( hd(U_1327) = '#skF_46'(U_1327) )
| ( nil = U_1327 )
| ~ ssList(U_1327) ),
inference(cnfTransformation,[status(thm)],[f_769]) ).
tff(c_1665,plain,
( ( hd('#skF_51') = '#skF_46'('#skF_51') )
| ( nil = '#skF_51' ) ),
inference(resolution,[status(thm)],[c_388,c_1581]) ).
tff(c_1699,plain,
hd('#skF_51') = '#skF_46'('#skF_51'),
inference(negUnitSimplification,[status(thm)],[c_1195,c_1665]) ).
tff(c_184,plain,
! [U_888] :
( ssItem(hd(U_888))
| ( nil = U_888 )
| ~ ssList(U_888) ),
inference(cnfTransformation,[status(thm)],[f_371]) ).
tff(c_1707,plain,
( ssItem('#skF_46'('#skF_51'))
| ( nil = '#skF_51' )
| ~ ssList('#skF_51') ),
inference(superposition,[status(thm),theory(equality)],[c_1699,c_184]) ).
tff(c_1711,plain,
( ssItem('#skF_46'('#skF_51'))
| ( nil = '#skF_51' ) ),
inference(demodulation,[status(thm),theory(equality)],[c_388,c_1707]) ).
tff(c_1712,plain,
ssItem('#skF_46'('#skF_51')),
inference(negUnitSimplification,[status(thm)],[c_1195,c_1711]) ).
tff(c_166,plain,
! [V_861,U_859] :
( ssList(cons(V_861,U_859))
| ~ ssItem(V_861)
| ~ ssList(U_859) ),
inference(cnfTransformation,[status(thm)],[f_318]) ).
tff(c_390,plain,
ssList('#skF_50'),
inference(cnfTransformation,[status(thm)],[f_1024]) ).
tff(c_1725,plain,
! [U_1330,V_1331] :
( ssList(app(U_1330,V_1331))
| ~ ssList(V_1331)
| ~ ssList(U_1330) ),
inference(cnfTransformation,[status(thm)],[f_399]) ).
tff(c_398,plain,
( ~ neq(nil,'#skF_51')
| ~ ssItem(hd('#skF_51'))
| ~ ssList(cons(hd('#skF_51'),nil))
| ( app(cons(hd('#skF_51'),nil),'#skF_50') = '#skF_51' )
| ~ ssList(app(cons(hd('#skF_51'),nil),'#skF_50'))
| ~ neq('#skF_51',nil) ),
inference(cnfTransformation,[status(thm)],[f_1024]) ).
tff(c_415,plain,
( ~ neq(nil,'#skF_51')
| ~ ssItem(hd('#skF_51'))
| ~ ssList(cons(hd('#skF_51'),nil))
| ( app(cons(hd('#skF_51'),nil),'#skF_50') = '#skF_51' )
| ~ ssList(app(cons(hd('#skF_51'),nil),'#skF_50')) ),
inference(demodulation,[status(thm),theory(equality)],[c_411,c_398]) ).
tff(c_430,plain,
~ ssList(app(cons(hd('#skF_51'),nil),'#skF_50')),
inference(splitLeft,[status(thm)],[c_415]) ).
tff(c_1703,plain,
~ ssList(app(cons('#skF_46'('#skF_51'),nil),'#skF_50')),
inference(demodulation,[status(thm),theory(equality)],[c_1699,c_430]) ).
tff(c_1728,plain,
( ~ ssList('#skF_50')
| ~ ssList(cons('#skF_46'('#skF_51'),nil)) ),
inference(resolution,[status(thm)],[c_1725,c_1703]) ).
tff(c_1776,plain,
~ ssList(cons('#skF_46'('#skF_51'),nil)),
inference(demodulation,[status(thm),theory(equality)],[c_390,c_1728]) ).
tff(c_1803,plain,
( ~ ssItem('#skF_46'('#skF_51'))
| ~ ssList(nil) ),
inference(resolution,[status(thm)],[c_166,c_1776]) ).
tff(c_1807,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_168,c_1712,c_1803]) ).
tff(c_1808,plain,
( ~ ssList(cons(hd('#skF_51'),nil))
| ~ ssItem(hd('#skF_51'))
| ~ neq(nil,'#skF_51')
| ( app(cons(hd('#skF_51'),nil),'#skF_50') = '#skF_51' ) ),
inference(splitRight,[status(thm)],[c_415]) ).
tff(c_1819,plain,
~ neq(nil,'#skF_51'),
inference(splitLeft,[status(thm)],[c_1808]) ).
tff(c_3260,plain,
( ( nil = '#skF_51' )
| ~ ssList('#skF_51')
| ~ ssList(nil) ),
inference(resolution,[status(thm)],[c_3253,c_1819]) ).
tff(c_3269,plain,
nil = '#skF_51',
inference(demodulation,[status(thm),theory(equality)],[c_168,c_388,c_3260]) ).
tff(c_3271,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_2393,c_3269]) ).
tff(c_3273,plain,
neq(nil,'#skF_51'),
inference(splitRight,[status(thm)],[c_1808]) ).
tff(c_5240,plain,
neq('#skF_51','#skF_51'),
inference(demodulation,[status(thm),theory(equality)],[c_5101,c_3273]) ).
tff(c_5271,plain,
~ ssList('#skF_51'),
inference(resolution,[status(thm)],[c_5240,c_164]) ).
tff(c_5276,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_388,c_5271]) ).
tff(c_5278,plain,
nil != '#skF_51',
inference(splitRight,[status(thm)],[c_5099]) ).
tff(c_5729,plain,
! [U_1578] :
( ( hd(U_1578) = '#skF_46'(U_1578) )
| ( nil = U_1578 )
| ~ ssList(U_1578) ),
inference(cnfTransformation,[status(thm)],[f_769]) ).
tff(c_5819,plain,
( ( hd('#skF_51') = '#skF_46'('#skF_51') )
| ( nil = '#skF_51' ) ),
inference(resolution,[status(thm)],[c_388,c_5729]) ).
tff(c_5855,plain,
hd('#skF_51') = '#skF_46'('#skF_51'),
inference(negUnitSimplification,[status(thm)],[c_5278,c_5819]) ).
tff(c_3624,plain,
! [U_1485] :
( ( tl(U_1485) = '#skF_47'(U_1485) )
| ( nil = U_1485 )
| ~ ssList(U_1485) ),
inference(cnfTransformation,[status(thm)],[f_779]) ).
tff(c_3732,plain,
( ( tl('#skF_51') = '#skF_47'('#skF_51') )
| ( nil = '#skF_51' ) ),
inference(resolution,[status(thm)],[c_388,c_3624]) ).
tff(c_3734,plain,
nil = '#skF_51',
inference(splitLeft,[status(thm)],[c_3732]) ).
tff(c_3763,plain,
neq('#skF_51','#skF_51'),
inference(demodulation,[status(thm),theory(equality)],[c_3734,c_3273]) ).
tff(c_4026,plain,
~ ssList('#skF_51'),
inference(resolution,[status(thm)],[c_3763,c_164]) ).
tff(c_4031,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_388,c_4026]) ).
tff(c_4033,plain,
nil != '#skF_51',
inference(splitRight,[status(thm)],[c_3732]) ).
tff(c_4118,plain,
! [U_1500] :
( ( hd(U_1500) = '#skF_46'(U_1500) )
| ( nil = U_1500 )
| ~ ssList(U_1500) ),
inference(cnfTransformation,[status(thm)],[f_769]) ).
tff(c_4196,plain,
( ( hd('#skF_51') = '#skF_46'('#skF_51') )
| ( nil = '#skF_51' ) ),
inference(resolution,[status(thm)],[c_388,c_4118]) ).
tff(c_4228,plain,
hd('#skF_51') = '#skF_46'('#skF_51'),
inference(negUnitSimplification,[status(thm)],[c_4033,c_4196]) ).
tff(c_4275,plain,
( ssItem('#skF_46'('#skF_51'))
| ( nil = '#skF_51' )
| ~ ssList('#skF_51') ),
inference(superposition,[status(thm),theory(equality)],[c_4228,c_184]) ).
tff(c_4279,plain,
( ssItem('#skF_46'('#skF_51'))
| ( nil = '#skF_51' ) ),
inference(demodulation,[status(thm),theory(equality)],[c_388,c_4275]) ).
tff(c_4280,plain,
ssItem('#skF_46'('#skF_51')),
inference(negUnitSimplification,[status(thm)],[c_4033,c_4279]) ).
tff(c_4526,plain,
! [V_1506,U_1507] :
( ssList(cons(V_1506,U_1507))
| ~ ssItem(V_1506)
| ~ ssList(U_1507) ),
inference(cnfTransformation,[status(thm)],[f_318]) ).
tff(c_3272,plain,
( ~ ssItem(hd('#skF_51'))
| ~ ssList(cons(hd('#skF_51'),nil))
| ( app(cons(hd('#skF_51'),nil),'#skF_50') = '#skF_51' ) ),
inference(splitRight,[status(thm)],[c_1808]) ).
tff(c_3276,plain,
~ ssList(cons(hd('#skF_51'),nil)),
inference(splitLeft,[status(thm)],[c_3272]) ).
tff(c_4270,plain,
~ ssList(cons('#skF_46'('#skF_51'),nil)),
inference(demodulation,[status(thm),theory(equality)],[c_4228,c_3276]) ).
tff(c_4532,plain,
( ~ ssItem('#skF_46'('#skF_51'))
| ~ ssList(nil) ),
inference(resolution,[status(thm)],[c_4526,c_4270]) ).
tff(c_4549,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_168,c_4280,c_4532]) ).
tff(c_4550,plain,
( ~ ssItem(hd('#skF_51'))
| ( app(cons(hd('#skF_51'),nil),'#skF_50') = '#skF_51' ) ),
inference(splitRight,[status(thm)],[c_3272]) ).
tff(c_4742,plain,
~ ssItem(hd('#skF_51')),
inference(splitLeft,[status(thm)],[c_4550]) ).
tff(c_4745,plain,
( ( nil = '#skF_51' )
| ~ ssList('#skF_51') ),
inference(resolution,[status(thm)],[c_184,c_4742]) ).
tff(c_4748,plain,
nil = '#skF_51',
inference(demodulation,[status(thm),theory(equality)],[c_388,c_4745]) ).
tff(c_4779,plain,
neq('#skF_51','#skF_51'),
inference(demodulation,[status(thm),theory(equality)],[c_4748,c_411]) ).
tff(c_4800,plain,
~ ssList('#skF_51'),
inference(resolution,[status(thm)],[c_4779,c_164]) ).
tff(c_4805,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_388,c_4800]) ).
tff(c_4806,plain,
app(cons(hd('#skF_51'),nil),'#skF_50') = '#skF_51',
inference(splitRight,[status(thm)],[c_4550]) ).
tff(c_5861,plain,
app(cons('#skF_46'('#skF_51'),nil),'#skF_50') = '#skF_51',
inference(demodulation,[status(thm),theory(equality)],[c_5855,c_4806]) ).
tff(c_4551,plain,
ssList(cons(hd('#skF_51'),nil)),
inference(splitRight,[status(thm)],[c_3272]) ).
tff(c_5863,plain,
ssList(cons('#skF_46'('#skF_51'),nil)),
inference(demodulation,[status(thm),theory(equality)],[c_5855,c_4551]) ).
tff(c_20699,plain,
! [W_2229,V_2230] :
( rearsegP(app(W_2229,V_2230),V_2230)
| ~ ssList(W_2229)
| ~ ssList(V_2230)
| ~ ssList(app(W_2229,V_2230)) ),
inference(cnfTransformation,[status(thm)],[f_120]) ).
tff(c_20857,plain,
( rearsegP('#skF_51','#skF_50')
| ~ ssList(cons('#skF_46'('#skF_51'),nil))
| ~ ssList('#skF_50')
| ~ ssList(app(cons('#skF_46'('#skF_51'),nil),'#skF_50')) ),
inference(superposition,[status(thm),theory(equality)],[c_5861,c_20699]) ).
tff(c_20971,plain,
rearsegP('#skF_51','#skF_50'),
inference(demodulation,[status(thm),theory(equality)],[c_388,c_5861,c_390,c_5863,c_20857]) ).
tff(c_20973,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_419,c_20971]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SWC366+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.14/0.35 % Computer : n006.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Thu Aug 3 21:22:28 EDT 2023
% 0.14/0.35 % CPUTime :
% 15.94/5.26 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 15.94/5.27
% 15.94/5.27 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 15.94/5.31
% 15.94/5.31 Inference rules
% 15.94/5.31 ----------------------
% 15.94/5.31 #Ref : 0
% 15.94/5.31 #Sup : 4488
% 15.94/5.31 #Fact : 0
% 15.94/5.31 #Define : 0
% 15.94/5.31 #Split : 60
% 15.94/5.31 #Chain : 0
% 15.94/5.31 #Close : 0
% 15.94/5.31
% 15.94/5.31 Ordering : KBO
% 15.94/5.31
% 15.94/5.31 Simplification rules
% 15.94/5.31 ----------------------
% 15.94/5.31 #Subsume : 525
% 15.94/5.31 #Demod : 3097
% 15.94/5.31 #Tautology : 1614
% 15.94/5.31 #SimpNegUnit : 284
% 15.94/5.31 #BackRed : 528
% 15.94/5.31
% 15.94/5.31 #Partial instantiations: 0
% 15.94/5.31 #Strategies tried : 1
% 15.94/5.31
% 15.94/5.31 Timing (in seconds)
% 15.94/5.31 ----------------------
% 15.94/5.31 Preprocessing : 0.88
% 15.94/5.31 Parsing : 0.40
% 15.94/5.31 CNF conversion : 0.11
% 15.94/5.31 Main loop : 3.35
% 15.94/5.31 Inferencing : 1.15
% 15.94/5.31 Reduction : 1.11
% 15.94/5.31 Demodulation : 0.80
% 15.94/5.31 BG Simplification : 0.11
% 15.94/5.31 Subsumption : 0.70
% 15.94/5.31 Abstraction : 0.09
% 15.94/5.31 MUC search : 0.00
% 15.94/5.31 Cooper : 0.00
% 15.94/5.31 Total : 4.29
% 15.94/5.31 Index Insertion : 0.00
% 15.94/5.31 Index Deletion : 0.00
% 15.94/5.31 Index Matching : 0.00
% 15.94/5.31 BG Taut test : 0.00
%------------------------------------------------------------------------------