TSTP Solution File: NUN062+2 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : NUN062+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 : n011.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:21 EDT 2023
% Result : Theorem 3.58s 1.86s
% Output : CNFRefutation 3.72s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 30
% Syntax : Number of formulae : 41 ( 7 unt; 26 typ; 0 def)
% Number of atoms : 31 ( 8 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 30 ( 14 ~; 8 |; 8 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 40 ( 24 >; 16 *; 0 +; 0 <<)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-3 aty)
% Number of functors : 22 ( 22 usr; 2 con; 0-2 aty)
% Number of variables : 35 (; 27 !; 8 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ r4 > r3 > r2 > r1 > #nlpp > #skF_11 > #skF_22 > #skF_16 > #skF_6 > #skF_2 > #skF_18 > #skF_19 > #skF_3 > #skF_15 > #skF_12 > #skF_10 > #skF_1 > #skF_8 > #skF_21 > #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_22',type,
'#skF_22': ( $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('#skF_21',type,
'#skF_21': $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_87,axiom,
! [X13,X14] :
? [Y22] :
! [X15] :
( ( ~ r3(X13,X14,X15)
& ( X15 != Y22 ) )
| ( r3(X13,X14,X15)
& ( X15 = Y22 ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/NUM008+0.ax',axiom_3) ).
tff(f_196,negated_conjecture,
~ ! [X1] :
? [Y2,Y1] :
( ! [Y4] :
( ~ r1(Y4)
| ( Y1 != Y4 ) )
& ? [Y3] :
( r3(X1,Y1,Y3)
& ( Y3 = Y2 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',infiniteNumbers) ).
tff(f_114,axiom,
! [X1,X8] :
? [Y4] :
( ? [Y5] :
( ? [Y15] :
( r2(X8,Y15)
& r3(X1,Y15,Y5) )
& ( Y5 = Y4 ) )
& ? [Y7] :
( r2(Y7,Y4)
& r3(X1,X8,Y7) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/NUM008+0.ax',axiom_1a) ).
tff(f_180,axiom,
! [X7,Y10] :
( ! [Y20] :
( ~ r1(Y20)
| ( Y20 != Y10 ) )
| ~ r2(X7,Y10) ),
file('/export/starexec/sandbox/benchmark/Axioms/NUM008+0.ax',axiom_7a) ).
tff(c_25,plain,
! [X13_9,X14_10] : r3(X13_9,X14_10,'#skF_3'(X13_9,X14_10)),
inference(cnfTransformation,[status(thm)],[f_87]) ).
tff(c_224,plain,
! [X13_130,X14_131] : r3(X13_130,X14_131,'#skF_3'(X13_130,X14_131)),
inference(cnfTransformation,[status(thm)],[f_87]) ).
tff(c_84,plain,
! [Y3_94,Y1_91] :
( ( '#skF_22'(Y3_94,Y1_91) = Y1_91 )
| ~ r3('#skF_21',Y1_91,Y3_94) ),
inference(cnfTransformation,[status(thm)],[f_196]) ).
tff(c_271,plain,
! [X14_136] : ( '#skF_22'('#skF_3'('#skF_21',X14_136),X14_136) = X14_136 ),
inference(resolution,[status(thm)],[c_224,c_84]) ).
tff(c_86,plain,
! [Y3_94,Y1_91] :
( r1('#skF_22'(Y3_94,Y1_91))
| ~ r3('#skF_21',Y1_91,Y3_94) ),
inference(cnfTransformation,[status(thm)],[f_196]) ).
tff(c_277,plain,
! [X14_136] :
( r1(X14_136)
| ~ r3('#skF_21',X14_136,'#skF_3'('#skF_21',X14_136)) ),
inference(superposition,[status(thm),theory(equality)],[c_271,c_86]) ).
tff(c_283,plain,
! [X14_136] : r1(X14_136),
inference(demodulation,[status(thm),theory(equality)],[c_25,c_277]) ).
tff(c_173,plain,
! [X8_112,X1_113] : r2(X8_112,'#skF_7'(X1_113,X8_112)),
inference(cnfTransformation,[status(thm)],[f_114]) ).
tff(c_82,plain,
! [X7_80,Y20_83] :
( ~ r2(X7_80,Y20_83)
| ~ r1(Y20_83) ),
inference(cnfTransformation,[status(thm)],[f_180]) ).
tff(c_177,plain,
! [X1_113,X8_112] : ~ r1('#skF_7'(X1_113,X8_112)),
inference(resolution,[status(thm)],[c_173,c_82]) ).
tff(c_297,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_283,c_177]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : NUN062+2 : TPTP v8.1.2. Released v7.3.0.
% 0.00/0.13 % 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 : n011.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:38:21 EDT 2023
% 0.13/0.35 % CPUTime :
% 3.58/1.86 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.58/1.86
% 3.58/1.86 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 3.72/1.89
% 3.72/1.89 Inference rules
% 3.72/1.89 ----------------------
% 3.72/1.89 #Ref : 0
% 3.72/1.89 #Sup : 42
% 3.72/1.89 #Fact : 0
% 3.72/1.89 #Define : 0
% 3.72/1.89 #Split : 0
% 3.72/1.89 #Chain : 0
% 3.72/1.89 #Close : 0
% 3.72/1.89
% 3.72/1.89 Ordering : KBO
% 3.72/1.89
% 3.72/1.89 Simplification rules
% 3.72/1.89 ----------------------
% 3.72/1.89 #Subsume : 2
% 3.72/1.89 #Demod : 26
% 3.72/1.89 #Tautology : 38
% 3.72/1.89 #SimpNegUnit : 0
% 3.72/1.89 #BackRed : 8
% 3.72/1.89
% 3.72/1.89 #Partial instantiations: 0
% 3.72/1.89 #Strategies tried : 1
% 3.72/1.89
% 3.72/1.89 Timing (in seconds)
% 3.72/1.89 ----------------------
% 3.72/1.89 Preprocessing : 0.56
% 3.72/1.89 Parsing : 0.27
% 3.72/1.89 CNF conversion : 0.05
% 3.72/1.89 Main loop : 0.26
% 3.72/1.89 Inferencing : 0.08
% 3.72/1.89 Reduction : 0.09
% 3.72/1.90 Demodulation : 0.06
% 3.72/1.90 BG Simplification : 0.02
% 3.72/1.90 Subsumption : 0.05
% 3.72/1.90 Abstraction : 0.02
% 3.72/1.90 MUC search : 0.00
% 3.72/1.90 Cooper : 0.00
% 3.72/1.90 Total : 0.87
% 3.72/1.90 Index Insertion : 0.00
% 3.72/1.90 Index Deletion : 0.00
% 3.72/1.90 Index Matching : 0.00
% 3.72/1.90 BG Taut test : 0.00
%------------------------------------------------------------------------------