TSTP Solution File: KRS200+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : KRS200+1 : TPTP v8.1.2. Bugfixed v5.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 : n016.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 10:46:05 EDT 2023
% Result : Theorem 14.10s 4.80s
% Output : CNFRefutation 14.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 106
% Syntax : Number of formulae : 117 ( 8 unt; 100 typ; 0 def)
% Number of atoms : 31 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 25 ( 11 ~; 8 |; 1 &)
% ( 3 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 124 ( 62 >; 62 *; 0 +; 0 <<)
% Number of predicates : 8 ( 7 usr; 1 prp; 0-3 aty)
% Number of functors : 93 ( 93 usr; 38 con; 0-2 aty)
% Number of variables : 32 (; 26 !; 6 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ status > xora > nota > nevera > model > mighta > isa > #nlpp > not > wth > wtc > wec > wca > uns > unp > thm > tca > tau > tac > sca > sat > sap > noc > eth > esa > eqv > csa > cax > #skF_47 > #skF_60 > #skF_37 > #skF_35 > #skF_57 > #skF_11 > #skF_22 > #skF_41 > #skF_67 > #skF_6 > #skF_26 > #skF_30 > #skF_44 > #skF_69 > #skF_53 > #skF_17 > #skF_20 > #skF_48 > #skF_55 > #skF_45 > #skF_32 > #skF_56 > #skF_31 > #skF_38 > #skF_3 > #skF_13 > #skF_71 > #skF_34 > #skF_14 > #skF_65 > #skF_12 > #skF_18 > #skF_19 > #skF_72 > #skF_33 > #skF_49 > #skF_61 > #skF_68 > #skF_10 > #skF_54 > #skF_42 > #skF_8 > #skF_51 > #skF_36 > #skF_64 > #skF_28 > #skF_24 > #skF_23 > #skF_50 > #skF_46 > #skF_52 > #skF_25 > #skF_2 > #skF_70 > #skF_66 > #skF_63 > #skF_40 > #skF_43 > #skF_7 > #skF_29 > #skF_27 > #skF_1 > #skF_16 > #skF_21 > #skF_59 > #skF_9 > #skF_73 > #skF_5 > #skF_58 > #skF_15 > #skF_4 > #skF_62 > #skF_39
%Foreground sorts:
%Background operators:
%Foreground operators:
tff('#skF_47',type,
'#skF_47': ( $i * $i ) > $i ).
tff('#skF_60',type,
'#skF_60': $i ).
tff('#skF_37',type,
'#skF_37': ( $i * $i ) > $i ).
tff('#skF_35',type,
'#skF_35': ( $i * $i ) > $i ).
tff('#skF_57',type,
'#skF_57': $i ).
tff('#skF_11',type,
'#skF_11': ( $i * $i ) > $i ).
tff('#skF_22',type,
'#skF_22': ( $i * $i ) > $i ).
tff('#skF_41',type,
'#skF_41': ( $i * $i ) > $i ).
tff(tac,type,
tac: $i ).
tff('#skF_67',type,
'#skF_67': $i ).
tff('#skF_6',type,
'#skF_6': ( $i * $i ) > $i ).
tff(cax,type,
cax: $i ).
tff(eqv,type,
eqv: $i ).
tff('#skF_26',type,
'#skF_26': ( $i * $i ) > $i ).
tff(eth,type,
eth: $i ).
tff(sap,type,
sap: $i ).
tff('#skF_30',type,
'#skF_30': ( $i * $i ) > $i ).
tff(tca,type,
tca: $i ).
tff('#skF_44',type,
'#skF_44': ( $i * $i ) > $i ).
tff('#skF_69',type,
'#skF_69': $i ).
tff(uns,type,
uns: $i ).
tff('#skF_53',type,
'#skF_53': ( $i * $i ) > $i ).
tff('#skF_17',type,
'#skF_17': ( $i * $i ) > $i ).
tff('#skF_20',type,
'#skF_20': ( $i * $i ) > $i ).
tff(wec,type,
wec: $i ).
tff(wca,type,
wca: $i ).
tff('#skF_48',type,
'#skF_48': ( $i * $i ) > $i ).
tff('#skF_55',type,
'#skF_55': $i ).
tff('#skF_45',type,
'#skF_45': ( $i * $i ) > $i ).
tff('#skF_32',type,
'#skF_32': ( $i * $i ) > $i ).
tff('#skF_56',type,
'#skF_56': $i ).
tff(sat,type,
sat: $i ).
tff(isa,type,
isa: ( $i * $i ) > $o ).
tff('#skF_31',type,
'#skF_31': ( $i * $i ) > $i ).
tff('#skF_38',type,
'#skF_38': ( $i * $i ) > $i ).
tff(status,type,
status: ( $i * $i * $i ) > $o ).
tff('#skF_3',type,
'#skF_3': ( $i * $i ) > $i ).
tff('#skF_13',type,
'#skF_13': ( $i * $i ) > $i ).
tff('#skF_71',type,
'#skF_71': $i ).
tff('#skF_34',type,
'#skF_34': ( $i * $i ) > $i ).
tff('#skF_14',type,
'#skF_14': ( $i * $i ) > $i ).
tff(xora,type,
xora: ( $i * $i ) > $o ).
tff('#skF_65',type,
'#skF_65': $i ).
tff('#skF_12',type,
'#skF_12': ( $i * $i ) > $i ).
tff('#skF_18',type,
'#skF_18': ( $i * $i ) > $i ).
tff(nota,type,
nota: ( $i * $i ) > $o ).
tff('#skF_19',type,
'#skF_19': ( $i * $i ) > $i ).
tff(model,type,
model: ( $i * $i ) > $o ).
tff(noc,type,
noc: $i ).
tff('#skF_72',type,
'#skF_72': $i ).
tff('#skF_33',type,
'#skF_33': ( $i * $i ) > $i ).
tff(not,type,
not: $i > $i ).
tff('#skF_49',type,
'#skF_49': ( $i * $i ) > $i ).
tff('#skF_61',type,
'#skF_61': $i ).
tff('#skF_68',type,
'#skF_68': $i ).
tff(wtc,type,
wtc: $i ).
tff('#skF_10',type,
'#skF_10': ( $i * $i ) > $i ).
tff('#skF_54',type,
'#skF_54': ( $i * $i ) > $i ).
tff(thm,type,
thm: $i ).
tff('#skF_42',type,
'#skF_42': ( $i * $i ) > $i ).
tff('#skF_8',type,
'#skF_8': ( $i * $i ) > $i ).
tff('#skF_51',type,
'#skF_51': ( $i * $i ) > $i ).
tff('#skF_36',type,
'#skF_36': ( $i * $i ) > $i ).
tff(unp,type,
unp: $i ).
tff('#skF_64',type,
'#skF_64': $i ).
tff('#skF_28',type,
'#skF_28': ( $i * $i ) > $i ).
tff('#skF_24',type,
'#skF_24': ( $i * $i ) > $i ).
tff(sca,type,
sca: $i ).
tff(esa,type,
esa: $i ).
tff('#skF_23',type,
'#skF_23': ( $i * $i ) > $i ).
tff('#skF_50',type,
'#skF_50': ( $i * $i ) > $i ).
tff('#skF_46',type,
'#skF_46': ( $i * $i ) > $i ).
tff('#skF_52',type,
'#skF_52': ( $i * $i ) > $i ).
tff(mighta,type,
mighta: ( $i * $i ) > $o ).
tff('#skF_25',type,
'#skF_25': ( $i * $i ) > $i ).
tff('#skF_2',type,
'#skF_2': ( $i * $i ) > $i ).
tff('#skF_70',type,
'#skF_70': $i ).
tff(nevera,type,
nevera: ( $i * $i ) > $o ).
tff('#skF_66',type,
'#skF_66': $i ).
tff(csa,type,
csa: $i ).
tff(tau,type,
tau: $i ).
tff('#skF_63',type,
'#skF_63': $i ).
tff('#skF_40',type,
'#skF_40': ( $i * $i ) > $i ).
tff(wth,type,
wth: $i ).
tff('#skF_43',type,
'#skF_43': ( $i * $i ) > $i ).
tff('#skF_7',type,
'#skF_7': ( $i * $i ) > $i ).
tff('#skF_29',type,
'#skF_29': ( $i * $i ) > $i ).
tff('#skF_27',type,
'#skF_27': ( $i * $i ) > $i ).
tff('#skF_1',type,
'#skF_1': ( $i * $i ) > $i ).
tff('#skF_16',type,
'#skF_16': ( $i * $i ) > $i ).
tff('#skF_21',type,
'#skF_21': ( $i * $i ) > $i ).
tff('#skF_59',type,
'#skF_59': $i ).
tff('#skF_9',type,
'#skF_9': ( $i * $i ) > $i ).
tff('#skF_73',type,
'#skF_73': $i ).
tff('#skF_5',type,
'#skF_5': ( $i * $i ) > $i ).
tff('#skF_58',type,
'#skF_58': $i ).
tff('#skF_15',type,
'#skF_15': ( $i * $i ) > $i ).
tff('#skF_4',type,
'#skF_4': ( $i * $i ) > $i ).
tff('#skF_62',type,
'#skF_62': $i ).
tff('#skF_39',type,
'#skF_39': ( $i * $i ) > $i ).
tff(f_375,negated_conjecture,
~ nota(unp,thm),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',nota_unp_thm) ).
tff(f_326,axiom,
? [F] :
! [I] : ~ model(I,F),
file('/export/starexec/sandbox/benchmark/Axioms/KRS001+1.ax',contradiction) ).
tff(f_59,axiom,
! [Ax,C] :
( ( ~ ? [I1] : model(I1,Ax)
=> ~ ? [I2] : model(I2,C) )
<=> status(Ax,C,unp) ),
file('/export/starexec/sandbox/benchmark/Axioms/KRS001+0.ax',unp) ).
tff(f_288,axiom,
! [S1,S2] :
( ? [Ax,C] :
( status(Ax,C,S1)
& ~ status(Ax,C,S2) )
<=> nota(S1,S2) ),
file('/export/starexec/sandbox/benchmark/Axioms/KRS001+1.ax',nota) ).
tff(f_315,axiom,
? [F] :
! [I] : model(I,F),
file('/export/starexec/sandbox/benchmark/Axioms/KRS001+1.ax',tautology) ).
tff(f_89,axiom,
! [Ax,C] :
( ! [I1] :
( model(I1,Ax)
=> model(I1,C) )
<=> status(Ax,C,thm) ),
file('/export/starexec/sandbox/benchmark/Axioms/KRS001+0.ax',thm) ).
tff(c_238,plain,
~ nota(unp,thm),
inference(cnfTransformation,[status(thm)],[f_375]) ).
tff(c_214,plain,
! [I_211] : ~ model(I_211,'#skF_59'),
inference(cnfTransformation,[status(thm)],[f_326]) ).
tff(c_1090,plain,
! [Ax_451,C_452] :
( model('#skF_2'(Ax_451,C_452),C_452)
| status(Ax_451,C_452,unp) ),
inference(cnfTransformation,[status(thm)],[f_59]) ).
tff(c_1123,plain,
! [Ax_451] : status(Ax_451,'#skF_59',unp),
inference(resolution,[status(thm)],[c_1090,c_214]) ).
tff(c_3060,plain,
! [S1_704,S2_705,Ax_706,C_707] :
( nota(S1_704,S2_705)
| status(Ax_706,C_707,S2_705)
| ~ status(Ax_706,C_707,S1_704) ),
inference(cnfTransformation,[status(thm)],[f_288]) ).
tff(c_14659,plain,
! [S2_930,Ax_931] :
( nota(unp,S2_930)
| status(Ax_931,'#skF_59',S2_930) ),
inference(resolution,[status(thm)],[c_1123,c_3060]) ).
tff(c_208,plain,
! [I_207] : model(I_207,'#skF_55'),
inference(cnfTransformation,[status(thm)],[f_315]) ).
tff(c_1775,plain,
! [I1_629,C_630,Ax_631] :
( model(I1_629,C_630)
| ~ model(I1_629,Ax_631)
| ~ status(Ax_631,C_630,thm) ),
inference(cnfTransformation,[status(thm)],[f_89]) ).
tff(c_1871,plain,
! [I_207,C_630] :
( model(I_207,C_630)
| ~ status('#skF_55',C_630,thm) ),
inference(resolution,[status(thm)],[c_208,c_1775]) ).
tff(c_14806,plain,
! [I_207] :
( model(I_207,'#skF_59')
| nota(unp,thm) ),
inference(resolution,[status(thm)],[c_14659,c_1871]) ).
tff(c_15375,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_238,c_214,c_14806]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : KRS200+1 : TPTP v8.1.2. Bugfixed v5.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.35 % Computer : n016.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Thu Aug 3 20:37:53 EDT 2023
% 0.15/0.35 % CPUTime :
% 14.10/4.80 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 14.10/4.80
% 14.10/4.80 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 14.10/4.84
% 14.10/4.84 Inference rules
% 14.10/4.84 ----------------------
% 14.10/4.84 #Ref : 0
% 14.10/4.84 #Sup : 4107
% 14.10/4.84 #Fact : 2
% 14.10/4.84 #Define : 0
% 14.10/4.84 #Split : 6
% 14.10/4.84 #Chain : 0
% 14.10/4.84 #Close : 0
% 14.10/4.84
% 14.10/4.84 Ordering : KBO
% 14.10/4.84
% 14.10/4.84 Simplification rules
% 14.10/4.84 ----------------------
% 14.10/4.84 #Subsume : 323
% 14.10/4.84 #Demod : 289
% 14.10/4.84 #Tautology : 271
% 14.10/4.84 #SimpNegUnit : 43
% 14.10/4.84 #BackRed : 0
% 14.10/4.84
% 14.10/4.84 #Partial instantiations: 0
% 14.10/4.84 #Strategies tried : 1
% 14.10/4.84
% 14.10/4.84 Timing (in seconds)
% 14.10/4.84 ----------------------
% 14.10/4.84 Preprocessing : 0.63
% 14.10/4.84 Parsing : 0.32
% 14.10/4.84 CNF conversion : 0.08
% 14.10/4.84 Main loop : 3.13
% 14.10/4.84 Inferencing : 0.85
% 14.10/4.84 Reduction : 1.04
% 14.10/4.84 Demodulation : 0.74
% 14.10/4.84 BG Simplification : 0.08
% 14.10/4.84 Subsumption : 0.86
% 14.10/4.84 Abstraction : 0.07
% 14.10/4.84 MUC search : 0.00
% 14.21/4.84 Cooper : 0.00
% 14.21/4.84 Total : 3.82
% 14.21/4.84 Index Insertion : 0.00
% 14.21/4.84 Index Deletion : 0.00
% 14.21/4.85 Index Matching : 0.00
% 14.21/4.85 BG Taut test : 0.00
%------------------------------------------------------------------------------