TSTP Solution File: NUN073+2 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : NUN073+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/sandbox2/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox2/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:53:23 EDT 2023
% Result : Theorem 4.31s 2.05s
% Output : CNFRefutation 4.34s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 34
% Syntax : Number of formulae : 58 ( 19 unt; 29 typ; 0 def)
% Number of atoms : 51 ( 19 equ)
% Maximal formula atoms : 6 ( 1 avg)
% Number of connectives : 48 ( 26 ~; 18 |; 4 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 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 : 25 ( 25 usr; 6 con; 0-2 aty)
% Number of variables : 26 (; 24 !; 2 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ r4 > r3 > r2 > r1 > #nlpp > #skF_11 > #skF_16 > #skF_6 > #skF_2 > #skF_18 > #skF_19 > #skF_25 > #skF_3 > #skF_15 > #skF_12 > #skF_10 > #skF_1 > #skF_8 > #skF_21 > #skF_13 > #skF_17 > #skF_22 > #skF_14 > #skF_24 > #skF_23 > #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_25',type,
'#skF_25': $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_22',type,
'#skF_22': $i ).
tff('#skF_14',type,
'#skF_14': $i > $i ).
tff('#skF_24',type,
'#skF_24': $i ).
tff('#skF_23',type,
'#skF_23': $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_205,negated_conjecture,
~ ! [Y1] :
( ! [Y2] :
( ! [Y4] :
( ~ r1(Y4)
| ~ r2(Y4,Y2) )
| ( Y2 != Y1 ) )
| ! [Y3] :
( ! [Y5] :
( ~ r1(Y5)
| ~ r2(Y5,Y3) )
| ~ r2(Y3,Y1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',oneuneqtwo) ).
tff(f_63,axiom,
? [Y24] :
! [X19] :
( ( ~ r1(X19)
& ( X19 != Y24 ) )
| ( r1(X19)
& ( X19 = Y24 ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/NUM008+0.ax',axiom_1) ).
tff(f_75,axiom,
! [X11] :
? [Y21] :
! [X12] :
( ( ~ r2(X11,X12)
& ( X12 != Y21 ) )
| ( r2(X11,X12)
& ( X12 = Y21 ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/NUM008+0.ax',axiom_2) ).
tff(f_141,axiom,
! [X3,X10] :
( ! [Y12] :
( ! [Y13] :
( ~ r2(X3,Y13)
| ( Y13 != Y12 ) )
| ~ r2(X10,Y12) )
| ( X3 = X10 ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/NUM008+0.ax',axiom_3a) ).
tff(f_180,axiom,
! [X7,Y10] :
( ! [Y20] :
( ~ r1(Y20)
| ( Y20 != Y10 ) )
| ~ r2(X7,Y10) ),
file('/export/starexec/sandbox2/benchmark/Axioms/NUM008+0.ax',axiom_7a) ).
tff(c_94,plain,
r1('#skF_23'),
inference(cnfTransformation,[status(thm)],[f_205]) ).
tff(c_117,plain,
! [X19_97] :
( ~ r1(X19_97)
| ( X19_97 = '#skF_1' ) ),
inference(cnfTransformation,[status(thm)],[f_63]) ).
tff(c_142,plain,
'#skF_1' = '#skF_23',
inference(resolution,[status(thm)],[c_94,c_117]) ).
tff(c_88,plain,
r1('#skF_25'),
inference(cnfTransformation,[status(thm)],[f_205]) ).
tff(c_141,plain,
'#skF_25' = '#skF_1',
inference(resolution,[status(thm)],[c_88,c_117]) ).
tff(c_86,plain,
r2('#skF_25','#skF_24'),
inference(cnfTransformation,[status(thm)],[f_205]) ).
tff(c_143,plain,
r2('#skF_1','#skF_24'),
inference(demodulation,[status(thm),theory(equality)],[c_141,c_86]) ).
tff(c_192,plain,
r2('#skF_23','#skF_24'),
inference(demodulation,[status(thm),theory(equality)],[c_142,c_143]) ).
tff(c_288,plain,
! [X11_129,X12_130] :
( ~ r2(X11_129,X12_130)
| ( X12_130 = '#skF_2'(X11_129) ) ),
inference(cnfTransformation,[status(thm)],[f_75]) ).
tff(c_309,plain,
'#skF_2'('#skF_23') = '#skF_24',
inference(resolution,[status(thm)],[c_192,c_288]) ).
tff(c_92,plain,
r2('#skF_23','#skF_22'),
inference(cnfTransformation,[status(thm)],[f_205]) ).
tff(c_313,plain,
'#skF_2'('#skF_23') = '#skF_22',
inference(resolution,[status(thm)],[c_92,c_288]) ).
tff(c_334,plain,
'#skF_22' = '#skF_24',
inference(demodulation,[status(thm),theory(equality)],[c_309,c_313]) ).
tff(c_90,plain,
'#skF_21' = '#skF_22',
inference(cnfTransformation,[status(thm)],[f_205]) ).
tff(c_84,plain,
r2('#skF_24','#skF_21'),
inference(cnfTransformation,[status(thm)],[f_205]) ).
tff(c_95,plain,
r2('#skF_24','#skF_22'),
inference(demodulation,[status(thm),theory(equality)],[c_90,c_84]) ).
tff(c_348,plain,
r2('#skF_24','#skF_24'),
inference(demodulation,[status(thm),theory(equality)],[c_334,c_95]) ).
tff(c_976,plain,
! [X3_191,X10_192,Y13_193] :
( ( X3_191 = X10_192 )
| ~ r2(X10_192,Y13_193)
| ~ r2(X3_191,Y13_193) ),
inference(cnfTransformation,[status(thm)],[f_141]) ).
tff(c_995,plain,
! [X3_194] :
( ( X3_194 = '#skF_23' )
| ~ r2(X3_194,'#skF_24') ),
inference(resolution,[status(thm)],[c_192,c_976]) ).
tff(c_1002,plain,
'#skF_24' = '#skF_23',
inference(resolution,[status(thm)],[c_348,c_995]) ).
tff(c_220,plain,
! [X7_109,Y20_110] :
( ~ r2(X7_109,Y20_110)
| ~ r1(Y20_110) ),
inference(cnfTransformation,[status(thm)],[f_180]) ).
tff(c_241,plain,
~ r1('#skF_24'),
inference(resolution,[status(thm)],[c_192,c_220]) ).
tff(c_1023,plain,
~ r1('#skF_23'),
inference(demodulation,[status(thm),theory(equality)],[c_1002,c_241]) ).
tff(c_1033,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_94,c_1023]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : NUN073+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/sandbox2/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox2/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 19:08:23 EDT 2023
% 0.15/0.35 % CPUTime :
% 4.31/2.05 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 4.31/2.05
% 4.31/2.05 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 4.34/2.08
% 4.34/2.08 Inference rules
% 4.34/2.08 ----------------------
% 4.34/2.08 #Ref : 0
% 4.34/2.08 #Sup : 221
% 4.34/2.08 #Fact : 0
% 4.34/2.08 #Define : 0
% 4.34/2.08 #Split : 0
% 4.34/2.08 #Chain : 0
% 4.34/2.08 #Close : 0
% 4.34/2.08
% 4.34/2.08 Ordering : KBO
% 4.34/2.08
% 4.34/2.08 Simplification rules
% 4.34/2.08 ----------------------
% 4.34/2.08 #Subsume : 28
% 4.34/2.08 #Demod : 161
% 4.34/2.08 #Tautology : 158
% 4.34/2.08 #SimpNegUnit : 0
% 4.34/2.08 #BackRed : 50
% 4.34/2.08
% 4.34/2.08 #Partial instantiations: 0
% 4.34/2.08 #Strategies tried : 1
% 4.34/2.08
% 4.34/2.08 Timing (in seconds)
% 4.34/2.08 ----------------------
% 4.34/2.08 Preprocessing : 0.55
% 4.34/2.08 Parsing : 0.27
% 4.34/2.09 CNF conversion : 0.05
% 4.34/2.09 Main loop : 0.47
% 4.34/2.09 Inferencing : 0.17
% 4.34/2.09 Reduction : 0.15
% 4.34/2.09 Demodulation : 0.11
% 4.34/2.09 BG Simplification : 0.03
% 4.34/2.09 Subsumption : 0.08
% 4.34/2.09 Abstraction : 0.02
% 4.34/2.09 MUC search : 0.00
% 4.34/2.09 Cooper : 0.00
% 4.34/2.09 Total : 1.07
% 4.34/2.09 Index Insertion : 0.00
% 4.34/2.09 Index Deletion : 0.00
% 4.34/2.09 Index Matching : 0.00
% 4.34/2.09 BG Taut test : 0.00
%------------------------------------------------------------------------------