TSTP Solution File: NUN089+2 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : NUN089+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 : n032.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 2.81s 1.70s
% Output : CNFRefutation 2.81s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 31
% Syntax : Number of formulae : 44 ( 11 unt; 28 typ; 0 def)
% Number of atoms : 27 ( 9 equ)
% Maximal formula atoms : 5 ( 1 avg)
% Number of connectives : 26 ( 15 ~; 9 |; 2 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 3 avg)
% Maximal term depth : 1 ( 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 : 24 ( 24 usr; 5 con; 0-2 aty)
% Number of variables : 12 (; 11 !; 1 ?; 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_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_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_201,negated_conjecture,
~ ! [Y1] :
( ! [Y2] :
( ! [Y3] :
( ~ r1(Y3)
| ~ r2(Y3,Y2) )
| ~ r2(Y2,Y1) )
| ! [Y4] :
( ( Y4 != Y1 )
| ~ r1(Y4) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',zerouneqtwo) ).
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_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_92,plain,
r1('#skF_23'),
inference(cnfTransformation,[status(thm)],[f_201]) ).
tff(c_115,plain,
! [X19_94] :
( ~ r1(X19_94)
| ( X19_94 = '#skF_1' ) ),
inference(cnfTransformation,[status(thm)],[f_63]) ).
tff(c_140,plain,
'#skF_1' = '#skF_23',
inference(resolution,[status(thm)],[c_92,c_115]) ).
tff(c_84,plain,
r1('#skF_24'),
inference(cnfTransformation,[status(thm)],[f_201]) ).
tff(c_139,plain,
'#skF_1' = '#skF_24',
inference(resolution,[status(thm)],[c_84,c_115]) ).
tff(c_148,plain,
'#skF_24' = '#skF_23',
inference(demodulation,[status(thm),theory(equality)],[c_140,c_139]) ).
tff(c_86,plain,
'#skF_21' = '#skF_24',
inference(cnfTransformation,[status(thm)],[f_201]) ).
tff(c_88,plain,
r2('#skF_22','#skF_21'),
inference(cnfTransformation,[status(thm)],[f_201]) ).
tff(c_93,plain,
r2('#skF_22','#skF_24'),
inference(demodulation,[status(thm),theory(equality)],[c_86,c_88]) ).
tff(c_153,plain,
r2('#skF_22','#skF_23'),
inference(demodulation,[status(thm),theory(equality)],[c_148,c_93]) ).
tff(c_223,plain,
! [X7_106,Y20_107] :
( ~ r2(X7_106,Y20_107)
| ~ r1(Y20_107) ),
inference(cnfTransformation,[status(thm)],[f_180]) ).
tff(c_232,plain,
~ r1('#skF_23'),
inference(resolution,[status(thm)],[c_153,c_223]) ).
tff(c_244,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_92,c_232]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10 % Problem : NUN089+2 : TPTP v8.1.2. Released v7.3.0.
% 0.00/0.11 % 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.10/0.30 % Computer : n032.cluster.edu
% 0.10/0.30 % Model : x86_64 x86_64
% 0.10/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.30 % Memory : 8042.1875MB
% 0.10/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.30 % CPULimit : 300
% 0.10/0.30 % WCLimit : 300
% 0.10/0.30 % DateTime : Thu Aug 3 18:40:21 EDT 2023
% 0.10/0.30 % CPUTime :
% 2.81/1.70 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.81/1.71
% 2.81/1.71 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 2.81/1.73
% 2.81/1.73 Inference rules
% 2.81/1.73 ----------------------
% 2.81/1.73 #Ref : 0
% 2.81/1.73 #Sup : 34
% 2.81/1.73 #Fact : 0
% 2.81/1.74 #Define : 0
% 2.81/1.74 #Split : 0
% 2.81/1.74 #Chain : 0
% 2.81/1.74 #Close : 0
% 2.81/1.74
% 2.81/1.74 Ordering : KBO
% 2.81/1.74
% 2.81/1.74 Simplification rules
% 2.81/1.74 ----------------------
% 2.81/1.74 #Subsume : 0
% 2.81/1.74 #Demod : 26
% 2.81/1.74 #Tautology : 37
% 2.81/1.74 #SimpNegUnit : 0
% 2.81/1.74 #BackRed : 10
% 2.81/1.74
% 2.81/1.74 #Partial instantiations: 0
% 2.81/1.74 #Strategies tried : 1
% 2.81/1.74
% 2.81/1.74 Timing (in seconds)
% 2.81/1.74 ----------------------
% 2.81/1.74 Preprocessing : 0.53
% 2.81/1.74 Parsing : 0.25
% 2.81/1.74 CNF conversion : 0.05
% 2.81/1.74 Main loop : 0.22
% 2.81/1.74 Inferencing : 0.06
% 2.81/1.74 Reduction : 0.08
% 2.81/1.74 Demodulation : 0.06
% 2.81/1.74 BG Simplification : 0.02
% 2.81/1.74 Subsumption : 0.04
% 2.81/1.74 Abstraction : 0.01
% 2.81/1.74 MUC search : 0.00
% 2.81/1.74 Cooper : 0.00
% 2.81/1.74 Total : 0.80
% 2.81/1.74 Index Insertion : 0.00
% 2.81/1.74 Index Deletion : 0.00
% 2.81/1.74 Index Matching : 0.00
% 2.81/1.74 BG Taut test : 0.00
%------------------------------------------------------------------------------