TSTP Solution File: NUN087+2 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : NUN087+2 : TPTP v8.1.2. Released v7.3.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 : n017.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:53:26 EDT 2023
% Result : Theorem 3.59s 1.79s
% Output : CNFRefutation 3.59s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 27
% Syntax : Number of formulae : 40 ( 11 unt; 24 typ; 0 def)
% Number of atoms : 28 ( 8 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 20 ( 8 ~; 4 |; 8 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 38 ( 23 >; 15 *; 0 +; 0 <<)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-3 aty)
% Number of functors : 20 ( 20 usr; 1 con; 0-2 aty)
% Number of variables : 20 (; 13 !; 7 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ r4 > r3 > r2 > r1 > #nlpp > #skF_11 > #skF_16 > #skF_6 > #skF_2 > #skF_18 > #skF_19 > #skF_3 > #skF_15 > #skF_12 > #skF_10 > #skF_1 > #skF_8 > #skF_13 > #skF_17 > #skF_14 > #skF_7 > #skF_9 > #skF_5 > #skF_4 > #skF_20
%Foreground sorts:
%Background operators:
%Foreground operators:
tff('#skF_11',type,
'#skF_11': ( $i * $i ) > $i ).
tff('#skF_16',type,
'#skF_16': $i > $i ).
tff('#skF_6',type,
'#skF_6': ( $i * $i ) > $i ).
tff('#skF_2',type,
'#skF_2': $i > $i ).
tff('#skF_18',type,
'#skF_18': $i > $i ).
tff('#skF_19',type,
'#skF_19': $i > $i ).
tff('#skF_3',type,
'#skF_3': ( $i * $i ) > $i ).
tff(r2,type,
r2: ( $i * $i ) > $o ).
tff('#skF_15',type,
'#skF_15': $i > $i ).
tff('#skF_12',type,
'#skF_12': ( $i * $i ) > $i ).
tff(r3,type,
r3: ( $i * $i * $i ) > $o ).
tff('#skF_10',type,
'#skF_10': ( $i * $i ) > $i ).
tff('#skF_1',type,
'#skF_1': $i ).
tff('#skF_8',type,
'#skF_8': ( $i * $i ) > $i ).
tff(r4,type,
r4: ( $i * $i * $i ) > $o ).
tff('#skF_13',type,
'#skF_13': $i > $i ).
tff('#skF_17',type,
'#skF_17': $i > $i ).
tff('#skF_14',type,
'#skF_14': $i > $i ).
tff('#skF_7',type,
'#skF_7': ( $i * $i ) > $i ).
tff(r1,type,
r1: $i > $o ).
tff('#skF_9',type,
'#skF_9': ( $i * $i ) > $i ).
tff('#skF_5',type,
'#skF_5': ( $i * $i ) > $i ).
tff('#skF_4',type,
'#skF_4': ( $i * $i ) > $i ).
tff('#skF_20',type,
'#skF_20': $i > $i ).
tff(f_63,axiom,
? [Y24] :
! [X19] :
( ( ~ r1(X19)
& ( X19 != Y24 ) )
| ( r1(X19)
& ( X19 = Y24 ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/NUM008+0.ax',axiom_1) ).
tff(f_160,axiom,
! [X5] :
? [Y8] :
( ? [Y17] :
( r1(Y17)
& r4(X5,Y17,Y8) )
& ? [Y18] :
( r1(Y18)
& ( Y8 = Y18 ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/NUM008+0.ax',axiom_5a) ).
tff(f_193,negated_conjecture,
~ ? [Y1] :
( ? [Y2] :
( r1(Y2)
& r4(Y2,Y2,Y1) )
& ? [Y3] :
( r1(Y3)
& ( Y1 = Y3 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',zerotimeszeroeqzero) ).
tff(c_7,plain,
r1('#skF_1'),
inference(cnfTransformation,[status(thm)],[f_63]) ).
tff(c_68,plain,
! [X5_68] : r1('#skF_17'(X5_68)),
inference(cnfTransformation,[status(thm)],[f_160]) ).
tff(c_111,plain,
! [X19_95] :
( ~ r1(X19_95)
| ( X19_95 = '#skF_1' ) ),
inference(cnfTransformation,[status(thm)],[f_63]) ).
tff(c_126,plain,
! [X5_68] : ( '#skF_17'(X5_68) = '#skF_1' ),
inference(resolution,[status(thm)],[c_68,c_111]) ).
tff(c_72,plain,
! [X5_68] : r1('#skF_16'(X5_68)),
inference(cnfTransformation,[status(thm)],[f_160]) ).
tff(c_124,plain,
! [X5_68] : ( '#skF_16'(X5_68) = '#skF_1' ),
inference(resolution,[status(thm)],[c_72,c_111]) ).
tff(c_66,plain,
! [X5_68] : ( '#skF_15'(X5_68) = '#skF_17'(X5_68) ),
inference(cnfTransformation,[status(thm)],[f_160]) ).
tff(c_70,plain,
! [X5_68] : r4(X5_68,'#skF_16'(X5_68),'#skF_15'(X5_68)),
inference(cnfTransformation,[status(thm)],[f_160]) ).
tff(c_85,plain,
! [X5_68] : r4(X5_68,'#skF_16'(X5_68),'#skF_17'(X5_68)),
inference(demodulation,[status(thm),theory(equality)],[c_66,c_70]) ).
tff(c_240,plain,
! [X5_122] : r4(X5_122,'#skF_1','#skF_1'),
inference(demodulation,[status(thm),theory(equality)],[c_126,c_124,c_85]) ).
tff(c_84,plain,
! [Y3_88,Y2_87] :
( ~ r1(Y3_88)
| ~ r4(Y2_87,Y2_87,Y3_88)
| ~ r1(Y2_87) ),
inference(cnfTransformation,[status(thm)],[f_193]) ).
tff(c_244,plain,
~ r1('#skF_1'),
inference(resolution,[status(thm)],[c_240,c_84]) ).
tff(c_248,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_7,c_244]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : NUN087+2 : TPTP v8.1.2. Released v7.3.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.13/0.35 % Computer : n017.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Thu Aug 3 18:06:21 EDT 2023
% 0.13/0.35 % CPUTime :
% 3.59/1.79 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.59/1.79
% 3.59/1.79 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 3.59/1.82
% 3.59/1.82 Inference rules
% 3.59/1.82 ----------------------
% 3.59/1.82 #Ref : 0
% 3.59/1.82 #Sup : 33
% 3.59/1.82 #Fact : 0
% 3.59/1.82 #Define : 0
% 3.59/1.82 #Split : 0
% 3.59/1.82 #Chain : 0
% 3.59/1.82 #Close : 0
% 3.59/1.82
% 3.59/1.82 Ordering : KBO
% 3.59/1.82
% 3.59/1.82 Simplification rules
% 3.59/1.82 ----------------------
% 3.59/1.82 #Subsume : 3
% 3.59/1.82 #Demod : 20
% 3.59/1.82 #Tautology : 32
% 3.59/1.82 #SimpNegUnit : 0
% 3.59/1.82 #BackRed : 6
% 3.59/1.82
% 3.59/1.82 #Partial instantiations: 0
% 3.59/1.82 #Strategies tried : 1
% 3.59/1.82
% 3.59/1.82 Timing (in seconds)
% 3.59/1.82 ----------------------
% 3.59/1.82 Preprocessing : 0.56
% 3.59/1.82 Parsing : 0.27
% 3.59/1.82 CNF conversion : 0.05
% 3.59/1.82 Main loop : 0.24
% 3.59/1.82 Inferencing : 0.07
% 3.59/1.82 Reduction : 0.09
% 3.59/1.82 Demodulation : 0.06
% 3.59/1.82 BG Simplification : 0.02
% 3.59/1.82 Subsumption : 0.05
% 3.59/1.82 Abstraction : 0.01
% 3.59/1.82 MUC search : 0.00
% 3.59/1.82 Cooper : 0.00
% 3.59/1.82 Total : 0.84
% 3.59/1.82 Index Insertion : 0.00
% 3.59/1.82 Index Deletion : 0.00
% 3.59/1.82 Index Matching : 0.00
% 3.59/1.82 BG Taut test : 0.00
%------------------------------------------------------------------------------