TSTP Solution File: KRS179+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : KRS179+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 : n001.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:03 EDT 2023
% Result : Theorem 9.89s 3.50s
% Output : CNFRefutation 9.89s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 43
% Syntax : Number of formulae : 62 ( 5 unt; 40 typ; 0 def)
% Number of atoms : 50 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 50 ( 22 ~; 22 |; 2 &)
% ( 2 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 36 ( 18 >; 18 *; 0 +; 0 <<)
% Number of predicates : 8 ( 7 usr; 1 prp; 0-3 aty)
% Number of functors : 33 ( 33 usr; 22 con; 0-2 aty)
% Number of variables : 47 (; 45 !; 2 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ status > xora > nota > nevera > model > mighta > isa > #nlpp > not > #skF_6 > #skF_20 > #skF_18 > #skF_17 > #skF_11 > #skF_31 > #skF_15 > #skF_25 > #skF_19 > #skF_3 > #skF_16 > #skF_26 > #skF_14 > #skF_13 > #skF_10 > #skF_8 > #skF_21 > #skF_32 > #skF_30 > #skF_22 > #skF_29 > #skF_28 > #skF_2 > #skF_24 > #skF_27 > #skF_23 > #skF_7 > #skF_1 > #skF_9 > #skF_5 > #skF_12 > #skF_4
%Foreground sorts:
%Background operators:
%Foreground operators:
tff('#skF_6',type,
'#skF_6': ( $i * $i ) > $i ).
tff('#skF_20',type,
'#skF_20': $i ).
tff('#skF_18',type,
'#skF_18': $i ).
tff('#skF_17',type,
'#skF_17': $i ).
tff('#skF_11',type,
'#skF_11': $i ).
tff('#skF_31',type,
'#skF_31': $i ).
tff('#skF_15',type,
'#skF_15': $i ).
tff('#skF_25',type,
'#skF_25': $i ).
tff(isa,type,
isa: ( $i * $i ) > $o ).
tff('#skF_19',type,
'#skF_19': $i ).
tff(status,type,
status: ( $i * $i * $i ) > $o ).
tff('#skF_3',type,
'#skF_3': ( $i * $i ) > $i ).
tff('#skF_16',type,
'#skF_16': $i ).
tff(xora,type,
xora: ( $i * $i ) > $o ).
tff('#skF_26',type,
'#skF_26': $i ).
tff('#skF_14',type,
'#skF_14': $i ).
tff(nota,type,
nota: ( $i * $i ) > $o ).
tff(model,type,
model: ( $i * $i ) > $o ).
tff('#skF_13',type,
'#skF_13': $i ).
tff(not,type,
not: $i > $i ).
tff('#skF_10',type,
'#skF_10': ( $i * $i ) > $i ).
tff('#skF_8',type,
'#skF_8': ( $i * $i ) > $i ).
tff('#skF_21',type,
'#skF_21': $i ).
tff('#skF_32',type,
'#skF_32': $i ).
tff('#skF_30',type,
'#skF_30': $i ).
tff('#skF_22',type,
'#skF_22': $i ).
tff(mighta,type,
mighta: ( $i * $i ) > $o ).
tff('#skF_29',type,
'#skF_29': $i ).
tff('#skF_28',type,
'#skF_28': $i ).
tff('#skF_2',type,
'#skF_2': ( $i * $i ) > $i ).
tff(nevera,type,
nevera: ( $i * $i ) > $o ).
tff('#skF_24',type,
'#skF_24': $i ).
tff('#skF_27',type,
'#skF_27': $i ).
tff('#skF_23',type,
'#skF_23': $i ).
tff('#skF_7',type,
'#skF_7': ( $i * $i ) > $i ).
tff('#skF_1',type,
'#skF_1': ( $i * $i ) > $i ).
tff('#skF_9',type,
'#skF_9': ( $i * $i ) > $i ).
tff('#skF_5',type,
'#skF_5': ( $i * $i ) > $i ).
tff('#skF_12',type,
'#skF_12': $i ).
tff('#skF_4',type,
'#skF_4': ( $i * $i ) > $i ).
tff(f_164,negated_conjecture,
~ ! [S1,S2,S3] :
( ( isa(S1,S2)
& isa(S2,S3) )
=> isa(S1,S3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',isa_transitive) ).
tff(f_64,axiom,
! [S1,S2] :
( ! [Ax,C] :
( status(Ax,C,S1)
=> status(Ax,C,S2) )
<=> isa(S1,S2) ),
file('/export/starexec/sandbox/benchmark/Axioms/KRS001+1.ax',isa) ).
tff(f_72,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(c_80,plain,
~ isa('#skF_30','#skF_32'),
inference(cnfTransformation,[status(thm)],[f_164]) ).
tff(c_84,plain,
isa('#skF_30','#skF_31'),
inference(cnfTransformation,[status(thm)],[f_164]) ).
tff(c_12,plain,
! [S1_9,S2_10] :
( status('#skF_3'(S1_9,S2_10),'#skF_4'(S1_9,S2_10),S1_9)
| isa(S1_9,S2_10) ),
inference(cnfTransformation,[status(thm)],[f_64]) ).
tff(c_136,plain,
! [S1_84,S2_85,Ax_86,C_87] :
( nota(S1_84,S2_85)
| status(Ax_86,C_87,S2_85)
| ~ status(Ax_86,C_87,S1_84) ),
inference(cnfTransformation,[status(thm)],[f_72]) ).
tff(c_260,plain,
! [S1_132,S2_133,S2_134] :
( nota(S1_132,S2_133)
| status('#skF_3'(S1_132,S2_134),'#skF_4'(S1_132,S2_134),S2_133)
| isa(S1_132,S2_134) ),
inference(resolution,[status(thm)],[c_12,c_136]) ).
tff(c_10,plain,
! [S1_9,S2_10] :
( ~ status('#skF_3'(S1_9,S2_10),'#skF_4'(S1_9,S2_10),S2_10)
| isa(S1_9,S2_10) ),
inference(cnfTransformation,[status(thm)],[f_64]) ).
tff(c_275,plain,
! [S1_132,S2_133] :
( nota(S1_132,S2_133)
| isa(S1_132,S2_133) ),
inference(resolution,[status(thm)],[c_260,c_10]) ).
tff(c_82,plain,
isa('#skF_31','#skF_32'),
inference(cnfTransformation,[status(thm)],[f_164]) ).
tff(c_18,plain,
! [S1_17,S2_18] :
( status('#skF_5'(S1_17,S2_18),'#skF_6'(S1_17,S2_18),S1_17)
| ~ nota(S1_17,S2_18) ),
inference(cnfTransformation,[status(thm)],[f_72]) ).
tff(c_188,plain,
! [Ax_97,C_98,S2_99,S1_100] :
( status(Ax_97,C_98,S2_99)
| ~ status(Ax_97,C_98,S1_100)
| ~ isa(S1_100,S2_99) ),
inference(cnfTransformation,[status(thm)],[f_64]) ).
tff(c_392,plain,
! [S1_164,S2_165,S2_166] :
( status('#skF_5'(S1_164,S2_165),'#skF_6'(S1_164,S2_165),S2_166)
| ~ isa(S1_164,S2_166)
| ~ nota(S1_164,S2_165) ),
inference(resolution,[status(thm)],[c_18,c_188]) ).
tff(c_8,plain,
! [Ax_15,C_16,S2_10,S1_9] :
( status(Ax_15,C_16,S2_10)
| ~ status(Ax_15,C_16,S1_9)
| ~ isa(S1_9,S2_10) ),
inference(cnfTransformation,[status(thm)],[f_64]) ).
tff(c_10005,plain,
! [S1_657,S2_658,S2_659,S2_660] :
( status('#skF_5'(S1_657,S2_658),'#skF_6'(S1_657,S2_658),S2_659)
| ~ isa(S2_660,S2_659)
| ~ isa(S1_657,S2_660)
| ~ nota(S1_657,S2_658) ),
inference(resolution,[status(thm)],[c_392,c_8]) ).
tff(c_10244,plain,
! [S1_666,S2_667] :
( status('#skF_5'(S1_666,S2_667),'#skF_6'(S1_666,S2_667),'#skF_32')
| ~ isa(S1_666,'#skF_31')
| ~ nota(S1_666,S2_667) ),
inference(resolution,[status(thm)],[c_82,c_10005]) ).
tff(c_16,plain,
! [S1_17,S2_18] :
( ~ status('#skF_5'(S1_17,S2_18),'#skF_6'(S1_17,S2_18),S2_18)
| ~ nota(S1_17,S2_18) ),
inference(cnfTransformation,[status(thm)],[f_72]) ).
tff(c_10280,plain,
! [S1_668] :
( ~ isa(S1_668,'#skF_31')
| ~ nota(S1_668,'#skF_32') ),
inference(resolution,[status(thm)],[c_10244,c_16]) ).
tff(c_10587,plain,
! [S1_669] :
( ~ isa(S1_669,'#skF_31')
| isa(S1_669,'#skF_32') ),
inference(resolution,[status(thm)],[c_275,c_10280]) ).
tff(c_10606,plain,
isa('#skF_30','#skF_32'),
inference(resolution,[status(thm)],[c_84,c_10587]) ).
tff(c_10612,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_80,c_10606]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : KRS179+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.36 % Computer : n001.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.22/0.36 % DateTime : Thu Aug 3 20:35:40 EDT 2023
% 0.22/0.36 % CPUTime :
% 9.89/3.50 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 9.89/3.51
% 9.89/3.51 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 9.89/3.54
% 9.89/3.54 Inference rules
% 9.89/3.54 ----------------------
% 9.89/3.54 #Ref : 0
% 9.89/3.54 #Sup : 2789
% 9.89/3.54 #Fact : 2
% 9.89/3.54 #Define : 0
% 9.89/3.54 #Split : 5
% 9.89/3.54 #Chain : 0
% 9.89/3.54 #Close : 0
% 9.89/3.54
% 9.89/3.54 Ordering : KBO
% 9.89/3.54
% 9.89/3.54 Simplification rules
% 9.89/3.54 ----------------------
% 9.89/3.54 #Subsume : 1017
% 9.89/3.54 #Demod : 459
% 9.89/3.54 #Tautology : 373
% 9.89/3.54 #SimpNegUnit : 9
% 9.89/3.54 #BackRed : 3
% 9.89/3.54
% 9.89/3.54 #Partial instantiations: 0
% 9.89/3.54 #Strategies tried : 1
% 9.89/3.54
% 9.89/3.54 Timing (in seconds)
% 9.89/3.54 ----------------------
% 9.89/3.54 Preprocessing : 0.52
% 9.89/3.54 Parsing : 0.28
% 9.89/3.54 CNF conversion : 0.05
% 9.89/3.54 Main loop : 1.94
% 9.89/3.54 Inferencing : 0.66
% 9.89/3.54 Reduction : 0.46
% 9.89/3.54 Demodulation : 0.29
% 9.89/3.54 BG Simplification : 0.05
% 9.89/3.54 Subsumption : 0.63
% 9.89/3.54 Abstraction : 0.05
% 9.89/3.54 MUC search : 0.00
% 9.89/3.54 Cooper : 0.00
% 9.89/3.54 Total : 2.52
% 9.89/3.54 Index Insertion : 0.00
% 9.89/3.54 Index Deletion : 0.00
% 9.89/3.54 Index Matching : 0.00
% 9.89/3.54 BG Taut test : 0.00
%------------------------------------------------------------------------------