TSTP Solution File: SWC380+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SWC380+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 : n018.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:23 EDT 2023
% Result : Theorem 12.47s 3.99s
% Output : CNFRefutation 12.66s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 89
% Syntax : Number of formulae : 156 ( 35 unt; 77 typ; 0 def)
% Number of atoms : 177 ( 76 equ)
% Maximal formula atoms : 16 ( 2 avg)
% Number of connectives : 165 ( 67 ~; 63 |; 5 &)
% ( 2 <=>; 28 =>; 0 <=; 0 <~>)
% Maximal formula depth : 21 ( 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 : 43 (; 40 !; 3 ?; 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_1021,negated_conjecture,
~ ! [U] :
( ssList(U)
=> ! [V] :
( ssList(V)
=> ! [W] :
( ssList(W)
=> ! [X] :
( ssList(X)
=> ( ( V != X )
| ( U != W )
| ( ( ~ neq(V,nil)
| ? [Y] :
( ssItem(Y)
& ( cons(Y,nil) = U )
& memberP(V,Y) )
| ! [Z] :
( ssItem(Z)
=> ! [X1] :
( ssList(X1)
=> ( ( cons(Z,nil) != W )
| ( app(cons(Z,nil),X1) != X ) ) ) ) )
& ( ~ neq(V,nil)
| neq(X,nil) ) ) ) ) ) ) ),
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_327,axiom,
! [U] :
( ssList(U)
=> ! [V] :
( ssItem(V)
=> ( cons(V,U) != U ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax18) ).
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_378,axiom,
! [U] :
( ssList(U)
=> ! [V] :
( ssItem(V)
=> ( hd(cons(V,U)) = V ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax23) ).
tff(f_869,axiom,
! [U] :
( ssList(U)
=> ! [V] :
( ssList(V)
=> ( ( nil != U )
=> ( hd(app(U,V)) = hd(U) ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax85) ).
tff(f_371,axiom,
! [U] :
( ssList(U)
=> ( ( nil != U )
=> ssItem(hd(U)) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax22) ).
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_385,axiom,
! [U] :
( ssList(U)
=> ( ( nil != U )
=> ssList(tl(U)) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax24) ).
tff(f_803,axiom,
! [U] :
( ssList(U)
=> ( ( nil != U )
=> ( cons(hd(U),tl(U)) = U ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax78) ).
tff(f_512,axiom,
! [U] :
( ssItem(U)
=> ! [V] :
( ssItem(V)
=> ! [W] :
( ssList(W)
=> ( memberP(cons(V,W),U)
<=> ( ( U = V )
| memberP(W,U) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax37) ).
tff(c_386,plain,
'#skF_49' = '#skF_51',
inference(cnfTransformation,[status(thm)],[f_1021]) ).
tff(c_418,plain,
neq('#skF_49',nil),
inference(cnfTransformation,[status(thm)],[f_1021]) ).
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_1021]) ).
tff(c_434,plain,
cons('#skF_52',nil) = '#skF_50',
inference(demodulation,[status(thm),theory(equality)],[c_426,c_398]) ).
tff(c_390,plain,
ssList('#skF_50'),
inference(cnfTransformation,[status(thm)],[f_1021]) ).
tff(c_402,plain,
( ssItem('#skF_52')
| ~ neq('#skF_51',nil) ),
inference(cnfTransformation,[status(thm)],[f_1021]) ).
tff(c_430,plain,
ssItem('#skF_52'),
inference(demodulation,[status(thm),theory(equality)],[c_426,c_402]) ).
tff(c_853,plain,
! [U_1261] :
( ( hd(U_1261) = '#skF_46'(U_1261) )
| ( nil = U_1261 )
| ~ ssList(U_1261) ),
inference(cnfTransformation,[status(thm)],[f_769]) ).
tff(c_962,plain,
( ( hd('#skF_50') = '#skF_46'('#skF_50') )
| ( nil = '#skF_50' ) ),
inference(resolution,[status(thm)],[c_390,c_853]) ).
tff(c_2804,plain,
nil = '#skF_50',
inference(splitLeft,[status(thm)],[c_962]) ).
tff(c_2838,plain,
cons('#skF_52','#skF_50') = '#skF_50',
inference(demodulation,[status(thm),theory(equality)],[c_2804,c_434]) ).
tff(c_3258,plain,
! [V_1333,U_1334] :
( ( cons(V_1333,U_1334) != U_1334 )
| ~ ssItem(V_1333)
| ~ ssList(U_1334) ),
inference(cnfTransformation,[status(thm)],[f_327]) ).
tff(c_3260,plain,
( ~ ssItem('#skF_52')
| ~ ssList('#skF_50') ),
inference(superposition,[status(thm),theory(equality)],[c_2838,c_3258]) ).
tff(c_3264,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_390,c_430,c_3260]) ).
tff(c_3266,plain,
nil != '#skF_50',
inference(splitRight,[status(thm)],[c_962]) ).
tff(c_400,plain,
( ssList('#skF_53')
| ~ neq('#skF_51',nil) ),
inference(cnfTransformation,[status(thm)],[f_1021]) ).
tff(c_432,plain,
ssList('#skF_53'),
inference(demodulation,[status(thm),theory(equality)],[c_426,c_400]) ).
tff(c_388,plain,
ssList('#skF_51'),
inference(cnfTransformation,[status(thm)],[f_1021]) ).
tff(c_961,plain,
( ( hd('#skF_51') = '#skF_46'('#skF_51') )
| ( nil = '#skF_51' ) ),
inference(resolution,[status(thm)],[c_388,c_853]) ).
tff(c_2593,plain,
nil = '#skF_51',
inference(splitLeft,[status(thm)],[c_961]) ).
tff(c_2627,plain,
neq('#skF_51','#skF_51'),
inference(demodulation,[status(thm),theory(equality)],[c_2593,c_426]) ).
tff(c_164,plain,
! [V_858] :
( ~ neq(V_858,V_858)
| ~ ssList(V_858) ),
inference(cnfTransformation,[status(thm)],[f_311]) ).
tff(c_2784,plain,
~ ssList('#skF_51'),
inference(resolution,[status(thm)],[c_2627,c_164]) ).
tff(c_2791,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_388,c_2784]) ).
tff(c_2792,plain,
hd('#skF_51') = '#skF_46'('#skF_51'),
inference(splitRight,[status(thm)],[c_961]) ).
tff(c_168,plain,
ssList(nil),
inference(cnfTransformation,[status(thm)],[f_319]) ).
tff(c_3265,plain,
hd('#skF_50') = '#skF_46'('#skF_50'),
inference(splitRight,[status(thm)],[c_962]) ).
tff(c_3932,plain,
! [V_1354,U_1355] :
( ( hd(cons(V_1354,U_1355)) = V_1354 )
| ~ ssItem(V_1354)
| ~ ssList(U_1355) ),
inference(cnfTransformation,[status(thm)],[f_378]) ).
tff(c_3944,plain,
( ( hd('#skF_50') = '#skF_52' )
| ~ ssItem('#skF_52')
| ~ ssList(nil) ),
inference(superposition,[status(thm),theory(equality)],[c_434,c_3932]) ).
tff(c_3948,plain,
'#skF_46'('#skF_50') = '#skF_52',
inference(demodulation,[status(thm),theory(equality)],[c_168,c_430,c_3265,c_3944]) ).
tff(c_3950,plain,
hd('#skF_50') = '#skF_52',
inference(demodulation,[status(thm),theory(equality)],[c_3948,c_3265]) ).
tff(c_396,plain,
( ( app(cons('#skF_52',nil),'#skF_53') = '#skF_51' )
| ~ neq('#skF_51',nil) ),
inference(cnfTransformation,[status(thm)],[f_1021]) ).
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_7614,plain,
! [U_1474,V_1475] :
( ( hd(app(U_1474,V_1475)) = hd(U_1474) )
| ( nil = U_1474 )
| ~ ssList(V_1475)
| ~ ssList(U_1474) ),
inference(cnfTransformation,[status(thm)],[f_869]) ).
tff(c_7815,plain,
( ( hd('#skF_51') = hd('#skF_50') )
| ( nil = '#skF_50' )
| ~ ssList('#skF_53')
| ~ ssList('#skF_50') ),
inference(superposition,[status(thm),theory(equality)],[c_439,c_7614]) ).
tff(c_8005,plain,
( ( '#skF_46'('#skF_51') = '#skF_52' )
| ( nil = '#skF_50' ) ),
inference(demodulation,[status(thm),theory(equality)],[c_390,c_432,c_2792,c_3950,c_7815]) ).
tff(c_8006,plain,
'#skF_46'('#skF_51') = '#skF_52',
inference(negUnitSimplification,[status(thm)],[c_3266,c_8005]) ).
tff(c_2793,plain,
nil != '#skF_51',
inference(splitRight,[status(thm)],[c_961]) ).
tff(c_184,plain,
! [U_888] :
( ssItem(hd(U_888))
| ( nil = U_888 )
| ~ ssList(U_888) ),
inference(cnfTransformation,[status(thm)],[f_371]) ).
tff(c_2797,plain,
( ssItem('#skF_46'('#skF_51'))
| ( nil = '#skF_51' )
| ~ ssList('#skF_51') ),
inference(superposition,[status(thm),theory(equality)],[c_2792,c_184]) ).
tff(c_2801,plain,
( ssItem('#skF_46'('#skF_51'))
| ( nil = '#skF_51' ) ),
inference(demodulation,[status(thm),theory(equality)],[c_388,c_2797]) ).
tff(c_2802,plain,
ssItem('#skF_46'('#skF_51')),
inference(negUnitSimplification,[status(thm)],[c_2793,c_2801]) ).
tff(c_3461,plain,
! [U_1342] :
( ( tl(U_1342) = '#skF_47'(U_1342) )
| ( nil = U_1342 )
| ~ ssList(U_1342) ),
inference(cnfTransformation,[status(thm)],[f_779]) ).
tff(c_3545,plain,
( ( tl('#skF_51') = '#skF_47'('#skF_51') )
| ( nil = '#skF_51' ) ),
inference(resolution,[status(thm)],[c_388,c_3461]) ).
tff(c_3581,plain,
tl('#skF_51') = '#skF_47'('#skF_51'),
inference(negUnitSimplification,[status(thm)],[c_2793,c_3545]) ).
tff(c_188,plain,
! [U_892] :
( ssList(tl(U_892))
| ( nil = U_892 )
| ~ ssList(U_892) ),
inference(cnfTransformation,[status(thm)],[f_385]) ).
tff(c_3598,plain,
( ssList('#skF_47'('#skF_51'))
| ( nil = '#skF_51' )
| ~ ssList('#skF_51') ),
inference(superposition,[status(thm),theory(equality)],[c_3581,c_188]) ).
tff(c_3602,plain,
( ssList('#skF_47'('#skF_51'))
| ( nil = '#skF_51' ) ),
inference(demodulation,[status(thm),theory(equality)],[c_388,c_3598]) ).
tff(c_3603,plain,
ssList('#skF_47'('#skF_51')),
inference(negUnitSimplification,[status(thm)],[c_2793,c_3602]) ).
tff(c_4350,plain,
! [U_1371] :
( ( cons(hd(U_1371),tl(U_1371)) = U_1371 )
| ( nil = U_1371 )
| ~ ssList(U_1371) ),
inference(cnfTransformation,[status(thm)],[f_803]) ).
tff(c_4387,plain,
( ( cons(hd('#skF_51'),'#skF_47'('#skF_51')) = '#skF_51' )
| ( nil = '#skF_51' )
| ~ ssList('#skF_51') ),
inference(superposition,[status(thm),theory(equality)],[c_3581,c_4350]) ).
tff(c_4408,plain,
( ( cons('#skF_46'('#skF_51'),'#skF_47'('#skF_51')) = '#skF_51' )
| ( nil = '#skF_51' ) ),
inference(demodulation,[status(thm),theory(equality)],[c_388,c_2792,c_4387]) ).
tff(c_4409,plain,
cons('#skF_46'('#skF_51'),'#skF_47'('#skF_51')) = '#skF_51',
inference(negUnitSimplification,[status(thm)],[c_2793,c_4408]) ).
tff(c_226,plain,
! [V_945,W_947] :
( memberP(cons(V_945,W_947),V_945)
| ~ ssList(W_947)
| ~ ssItem(V_945) ),
inference(cnfTransformation,[status(thm)],[f_512]) ).
tff(c_4428,plain,
( memberP('#skF_51','#skF_46'('#skF_51'))
| ~ ssList('#skF_47'('#skF_51'))
| ~ ssItem('#skF_46'('#skF_51')) ),
inference(superposition,[status(thm),theory(equality)],[c_4409,c_226]) ).
tff(c_4443,plain,
memberP('#skF_51','#skF_46'('#skF_51')),
inference(demodulation,[status(thm),theory(equality)],[c_2802,c_3603,c_4428]) ).
tff(c_384,plain,
'#skF_48' = '#skF_50',
inference(cnfTransformation,[status(thm)],[f_1021]) ).
tff(c_404,plain,
! [Y_1193] :
( ~ memberP('#skF_49',Y_1193)
| ( cons(Y_1193,nil) != '#skF_48' )
| ~ ssItem(Y_1193)
| ~ neq('#skF_51',nil) ),
inference(cnfTransformation,[status(thm)],[f_1021]) ).
tff(c_427,plain,
! [Y_1193] :
( ~ memberP('#skF_51',Y_1193)
| ( cons(Y_1193,nil) != '#skF_48' )
| ~ ssItem(Y_1193)
| ~ neq('#skF_51',nil) ),
inference(demodulation,[status(thm),theory(equality)],[c_386,c_404]) ).
tff(c_438,plain,
! [Y_1193] :
( ~ memberP('#skF_51',Y_1193)
| ( cons(Y_1193,nil) != '#skF_48' )
| ~ ssItem(Y_1193) ),
inference(demodulation,[status(thm),theory(equality)],[c_426,c_427]) ).
tff(c_441,plain,
! [Y_1193] :
( ~ memberP('#skF_51',Y_1193)
| ( cons(Y_1193,nil) != '#skF_50' )
| ~ ssItem(Y_1193) ),
inference(demodulation,[status(thm),theory(equality)],[c_384,c_438]) ).
tff(c_4453,plain,
( ( cons('#skF_46'('#skF_51'),nil) != '#skF_50' )
| ~ ssItem('#skF_46'('#skF_51')) ),
inference(resolution,[status(thm)],[c_4443,c_441]) ).
tff(c_4456,plain,
cons('#skF_46'('#skF_51'),nil) != '#skF_50',
inference(demodulation,[status(thm),theory(equality)],[c_2802,c_4453]) ).
tff(c_8007,plain,
cons('#skF_52',nil) != '#skF_50',
inference(demodulation,[status(thm),theory(equality)],[c_8006,c_4456]) ).
tff(c_8014,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_434,c_8007]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.14 % Problem : SWC380+1 : TPTP v8.1.2. Released v2.4.0.
% 0.13/0.15 % 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.37 % Computer : n018.cluster.edu
% 0.14/0.37 % Model : x86_64 x86_64
% 0.14/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.37 % Memory : 8042.1875MB
% 0.14/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.37 % CPULimit : 300
% 0.14/0.37 % WCLimit : 300
% 0.14/0.37 % DateTime : Thu Aug 3 21:27:20 EDT 2023
% 0.14/0.37 % CPUTime :
% 12.47/3.99 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 12.47/4.00
% 12.47/4.00 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 12.66/4.04
% 12.66/4.04 Inference rules
% 12.66/4.04 ----------------------
% 12.66/4.04 #Ref : 0
% 12.66/4.04 #Sup : 1684
% 12.66/4.04 #Fact : 0
% 12.66/4.04 #Define : 0
% 12.66/4.04 #Split : 33
% 12.66/4.04 #Chain : 0
% 12.66/4.04 #Close : 0
% 12.66/4.04
% 12.66/4.04 Ordering : KBO
% 12.66/4.04
% 12.66/4.04 Simplification rules
% 12.66/4.04 ----------------------
% 12.66/4.04 #Subsume : 143
% 12.66/4.04 #Demod : 1177
% 12.66/4.04 #Tautology : 716
% 12.66/4.04 #SimpNegUnit : 132
% 12.66/4.04 #BackRed : 226
% 12.66/4.04
% 12.66/4.04 #Partial instantiations: 0
% 12.66/4.04 #Strategies tried : 1
% 12.66/4.04
% 12.66/4.04 Timing (in seconds)
% 12.66/4.04 ----------------------
% 12.66/4.04 Preprocessing : 0.93
% 12.66/4.04 Parsing : 0.44
% 12.66/4.04 CNF conversion : 0.12
% 12.66/4.04 Main loop : 1.95
% 12.66/4.04 Inferencing : 0.65
% 12.66/4.04 Reduction : 0.67
% 12.66/4.04 Demodulation : 0.48
% 12.72/4.04 BG Simplification : 0.10
% 12.72/4.04 Subsumption : 0.38
% 12.72/4.04 Abstraction : 0.06
% 12.72/4.04 MUC search : 0.00
% 12.72/4.04 Cooper : 0.00
% 12.72/4.04 Total : 2.94
% 12.72/4.04 Index Insertion : 0.00
% 12.72/4.04 Index Deletion : 0.00
% 12.72/4.04 Index Matching : 0.00
% 12.72/4.04 BG Taut test : 0.00
%------------------------------------------------------------------------------