TSTP Solution File: NUN076+2 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : NUN076+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 : n025.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:24 EDT 2023
% Result : Theorem 5.75s 2.41s
% Output : CNFRefutation 6.00s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 31
% Syntax : Number of formulae : 67 ( 28 unt; 24 typ; 0 def)
% Number of atoms : 82 ( 24 equ)
% Maximal formula atoms : 7 ( 1 avg)
% Number of connectives : 67 ( 28 ~; 18 |; 21 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 4 avg)
% Maximal term depth : 3 ( 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 : 85 (; 65 !; 20 ?; 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_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_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_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_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_149,axiom,
! [X4] :
? [Y9] :
( ? [Y16] :
( r1(Y16)
& r3(X4,Y16,Y9) )
& ( Y9 = X4 ) ),
file('/export/starexec/sandbox/benchmark/Axioms/NUM008+0.ax',axiom_4a) ).
tff(f_75,axiom,
! [X11] :
? [Y21] :
! [X12] :
( ( ~ r2(X11,X12)
& ( X12 != Y21 ) )
| ( r2(X11,X12)
& ( X12 = Y21 ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/NUM008+0.ax',axiom_2) ).
tff(f_202,negated_conjecture,
~ ? [Y1,Y2,Y3] :
( ? [Y4] :
( ( Y4 = Y1 )
& ? [Y6] :
( r4(Y6,Y2,Y4)
& ? [Y7] :
( r2(Y7,Y6)
& ? [Y8] :
( r1(Y8)
& r2(Y8,Y7) ) ) ) )
& ? [Y5] :
( r3(Y2,Y3,Y5)
& ( Y5 = Y1 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',thereexistsanevennumber) ).
tff(c_68,plain,
! [X5_68] : r1('#skF_17'(X5_68)),
inference(cnfTransformation,[status(thm)],[f_160]) ).
tff(c_111,plain,
! [X19_125] :
( ~ r1(X19_125)
| ( X19_125 = '#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_202,plain,
! [X5_68] : r4(X5_68,'#skF_1','#skF_1'),
inference(demodulation,[status(thm),theory(equality)],[c_126,c_124,c_85]) ).
tff(c_38,plain,
! [X1_23,X8_24] : r3(X1_23,X8_24,'#skF_8'(X1_23,X8_24)),
inference(cnfTransformation,[status(thm)],[f_114]) ).
tff(c_511,plain,
! [X13_209,X14_210,X15_211] :
( ~ r3(X13_209,X14_210,X15_211)
| ( X15_211 = '#skF_3'(X13_209,X14_210) ) ),
inference(cnfTransformation,[status(thm)],[f_87]) ).
tff(c_550,plain,
! [X1_213,X8_214] : ( '#skF_3'(X1_213,X8_214) = '#skF_8'(X1_213,X8_214) ),
inference(resolution,[status(thm)],[c_38,c_511]) ).
tff(c_64,plain,
! [X4_63] : r1('#skF_14'(X4_63)),
inference(cnfTransformation,[status(thm)],[f_149]) ).
tff(c_125,plain,
! [X4_63] : ( '#skF_14'(X4_63) = '#skF_1' ),
inference(resolution,[status(thm)],[c_64,c_111]) ).
tff(c_60,plain,
! [X4_63] : ( '#skF_13'(X4_63) = X4_63 ),
inference(cnfTransformation,[status(thm)],[f_149]) ).
tff(c_62,plain,
! [X4_63] : r3(X4_63,'#skF_14'(X4_63),'#skF_13'(X4_63)),
inference(cnfTransformation,[status(thm)],[f_149]) ).
tff(c_86,plain,
! [X4_63] : r3(X4_63,'#skF_14'(X4_63),X4_63),
inference(demodulation,[status(thm),theory(equality)],[c_60,c_62]) ).
tff(c_184,plain,
! [X4_63] : r3(X4_63,'#skF_1',X4_63),
inference(demodulation,[status(thm),theory(equality)],[c_125,c_86]) ).
tff(c_532,plain,
! [X4_63] : ( '#skF_3'(X4_63,'#skF_1') = X4_63 ),
inference(resolution,[status(thm)],[c_184,c_511]) ).
tff(c_566,plain,
! [X1_215] : ( '#skF_8'(X1_215,'#skF_1') = X1_215 ),
inference(superposition,[status(thm),theory(equality)],[c_550,c_532]) ).
tff(c_40,plain,
! [X1_23,X8_24] : r2('#skF_8'(X1_23,X8_24),'#skF_5'(X1_23,X8_24)),
inference(cnfTransformation,[status(thm)],[f_114]) ).
tff(c_575,plain,
! [X1_215] : r2(X1_215,'#skF_5'(X1_215,'#skF_1')),
inference(superposition,[status(thm),theory(equality)],[c_566,c_40]) ).
tff(c_367,plain,
! [X1_177,X8_178] : r2('#skF_8'(X1_177,X8_178),'#skF_5'(X1_177,X8_178)),
inference(cnfTransformation,[status(thm)],[f_114]) ).
tff(c_14,plain,
! [X11_3,X12_8] :
( ~ r2(X11_3,X12_8)
| ( X12_8 = '#skF_2'(X11_3) ) ),
inference(cnfTransformation,[status(thm)],[f_75]) ).
tff(c_377,plain,
! [X1_177,X8_178] : ( '#skF_2'('#skF_8'(X1_177,X8_178)) = '#skF_5'(X1_177,X8_178) ),
inference(resolution,[status(thm)],[c_367,c_14]) ).
tff(c_572,plain,
! [X1_215] : ( '#skF_2'(X1_215) = '#skF_5'(X1_215,'#skF_1') ),
inference(superposition,[status(thm),theory(equality)],[c_566,c_377]) ).
tff(c_16,plain,
! [X11_3] : r2(X11_3,'#skF_2'(X11_3)),
inference(cnfTransformation,[status(thm)],[f_75]) ).
tff(c_185,plain,
! [X4_149] : r3(X4_149,'#skF_1',X4_149),
inference(demodulation,[status(thm),theory(equality)],[c_125,c_86]) ).
tff(c_84,plain,
! [Y5_118,Y8_117,Y2_85,Y3_86,Y6_111,Y7_115] :
( ~ r3(Y2_85,Y3_86,Y5_118)
| ~ r2(Y8_117,Y7_115)
| ~ r1(Y8_117)
| ~ r2(Y7_115,Y6_111)
| ~ r4(Y6_111,Y2_85,Y5_118) ),
inference(cnfTransformation,[status(thm)],[f_202]) ).
tff(c_266,plain,
! [Y8_163,Y7_164,Y6_165,X4_166] :
( ~ r2(Y8_163,Y7_164)
| ~ r1(Y8_163)
| ~ r2(Y7_164,Y6_165)
| ~ r4(Y6_165,X4_166,X4_166) ),
inference(resolution,[status(thm)],[c_185,c_84]) ).
tff(c_275,plain,
! [X11_3,Y6_165,X4_166] :
( ~ r1(X11_3)
| ~ r2('#skF_2'(X11_3),Y6_165)
| ~ r4(Y6_165,X4_166,X4_166) ),
inference(resolution,[status(thm)],[c_16,c_266]) ).
tff(c_1401,plain,
! [X11_286,Y6_287,X4_288] :
( ~ r1(X11_286)
| ~ r2('#skF_5'(X11_286,'#skF_1'),Y6_287)
| ~ r4(Y6_287,X4_288,X4_288) ),
inference(demodulation,[status(thm),theory(equality)],[c_572,c_275]) ).
tff(c_3251,plain,
! [X11_363,X4_364] :
( ~ r1(X11_363)
| ~ r4('#skF_5'('#skF_5'(X11_363,'#skF_1'),'#skF_1'),X4_364,X4_364) ),
inference(resolution,[status(thm)],[c_575,c_1401]) ).
tff(c_3270,plain,
! [X11_363] : ~ r1(X11_363),
inference(resolution,[status(thm)],[c_202,c_3251]) ).
tff(c_7,plain,
r1('#skF_1'),
inference(cnfTransformation,[status(thm)],[f_63]) ).
tff(c_3282,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_3270,c_7]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : NUN076+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.14/0.36 % Computer : n025.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Thu Aug 3 18:52:04 EDT 2023
% 0.14/0.36 % CPUTime :
% 5.75/2.41 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 5.75/2.42
% 5.75/2.42 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 6.00/2.45
% 6.00/2.45 Inference rules
% 6.00/2.45 ----------------------
% 6.00/2.45 #Ref : 0
% 6.00/2.45 #Sup : 834
% 6.00/2.45 #Fact : 0
% 6.00/2.45 #Define : 0
% 6.00/2.45 #Split : 0
% 6.00/2.45 #Chain : 0
% 6.00/2.45 #Close : 0
% 6.00/2.45
% 6.00/2.45 Ordering : KBO
% 6.00/2.45
% 6.00/2.45 Simplification rules
% 6.00/2.45 ----------------------
% 6.00/2.45 #Subsume : 142
% 6.00/2.45 #Demod : 445
% 6.00/2.45 #Tautology : 349
% 6.00/2.45 #SimpNegUnit : 13
% 6.00/2.45 #BackRed : 33
% 6.00/2.45
% 6.00/2.45 #Partial instantiations: 0
% 6.00/2.45 #Strategies tried : 1
% 6.00/2.45
% 6.00/2.45 Timing (in seconds)
% 6.00/2.45 ----------------------
% 6.00/2.45 Preprocessing : 0.55
% 6.00/2.45 Parsing : 0.26
% 6.00/2.45 CNF conversion : 0.05
% 6.00/2.45 Main loop : 0.83
% 6.00/2.45 Inferencing : 0.30
% 6.00/2.46 Reduction : 0.27
% 6.00/2.46 Demodulation : 0.20
% 6.00/2.46 BG Simplification : 0.04
% 6.00/2.46 Subsumption : 0.16
% 6.00/2.46 Abstraction : 0.04
% 6.00/2.46 MUC search : 0.00
% 6.00/2.46 Cooper : 0.00
% 6.05/2.46 Total : 1.42
% 6.05/2.46 Index Insertion : 0.00
% 6.05/2.46 Index Deletion : 0.00
% 6.05/2.46 Index Matching : 0.00
% 6.05/2.46 BG Taut test : 0.00
%------------------------------------------------------------------------------