TSTP Solution File: NUN088+2 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : NUN088+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 : n001.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.06s 1.83s
% Output : CNFRefutation 3.41s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 30
% Syntax : Number of formulae : 43 ( 11 unt; 27 typ; 0 def)
% Number of atoms : 26 ( 9 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 24 ( 14 ~; 8 |; 2 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 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 : 23 ( 23 usr; 4 con; 0-2 aty)
% Number of variables : 11 (; 10 !; 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_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_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_197,negated_conjecture,
~ ! [Y1] :
( ! [Y2] :
( ~ r1(Y2)
| ( Y2 != Y1 ) )
| ! [Y3] :
( ~ r1(Y3)
| ~ r2(Y3,Y1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',zerouneqone) ).
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_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_86,plain,
r1('#skF_23'),
inference(cnfTransformation,[status(thm)],[f_197]) ).
tff(c_121,plain,
! [X19_91] :
( ~ r1(X19_91)
| ( X19_91 = '#skF_1' ) ),
inference(cnfTransformation,[status(thm)],[f_63]) ).
tff(c_143,plain,
'#skF_1' = '#skF_23',
inference(resolution,[status(thm)],[c_86,c_121]) ).
tff(c_90,plain,
r1('#skF_22'),
inference(cnfTransformation,[status(thm)],[f_197]) ).
tff(c_146,plain,
'#skF_1' = '#skF_22',
inference(resolution,[status(thm)],[c_90,c_121]) ).
tff(c_154,plain,
'#skF_22' = '#skF_23',
inference(demodulation,[status(thm),theory(equality)],[c_143,c_146]) ).
tff(c_88,plain,
'#skF_21' = '#skF_22',
inference(cnfTransformation,[status(thm)],[f_197]) ).
tff(c_84,plain,
r2('#skF_23','#skF_21'),
inference(cnfTransformation,[status(thm)],[f_197]) ).
tff(c_91,plain,
r2('#skF_23','#skF_22'),
inference(demodulation,[status(thm),theory(equality)],[c_88,c_84]) ).
tff(c_155,plain,
r2('#skF_23','#skF_23'),
inference(demodulation,[status(thm),theory(equality)],[c_154,c_91]) ).
tff(c_216,plain,
! [X7_103,Y20_104] :
( ~ r2(X7_103,Y20_104)
| ~ r1(Y20_104) ),
inference(cnfTransformation,[status(thm)],[f_180]) ).
tff(c_225,plain,
~ r1('#skF_23'),
inference(resolution,[status(thm)],[c_155,c_216]) ).
tff(c_234,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_86,c_225]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.14 % Problem : NUN088+2 : TPTP v8.1.2. Released v7.3.0.
% 0.14/0.15 % 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.14/0.37 % Computer : n001.cluster.edu
% 0.14/0.37 % Model : x86_64 x86_64
% 0.14/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.37 % Memory : 8042.1875MB
% 0.14/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.37 % CPULimit : 300
% 0.14/0.37 % WCLimit : 300
% 0.14/0.37 % DateTime : Thu Aug 3 19:10:55 EDT 2023
% 0.14/0.38 % CPUTime :
% 3.06/1.83 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.06/1.84
% 3.06/1.84 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 3.41/1.86
% 3.41/1.86 Inference rules
% 3.41/1.86 ----------------------
% 3.41/1.86 #Ref : 0
% 3.41/1.86 #Sup : 31
% 3.41/1.86 #Fact : 0
% 3.41/1.86 #Define : 0
% 3.41/1.86 #Split : 0
% 3.41/1.86 #Chain : 0
% 3.41/1.86 #Close : 0
% 3.41/1.86
% 3.41/1.86 Ordering : KBO
% 3.41/1.86
% 3.41/1.86 Simplification rules
% 3.41/1.86 ----------------------
% 3.41/1.86 #Subsume : 0
% 3.41/1.86 #Demod : 25
% 3.41/1.86 #Tautology : 35
% 3.41/1.86 #SimpNegUnit : 0
% 3.41/1.86 #BackRed : 9
% 3.41/1.86
% 3.41/1.86 #Partial instantiations: 0
% 3.41/1.86 #Strategies tried : 1
% 3.41/1.86
% 3.41/1.86 Timing (in seconds)
% 3.41/1.86 ----------------------
% 3.41/1.87 Preprocessing : 0.54
% 3.41/1.87 Parsing : 0.27
% 3.41/1.87 CNF conversion : 0.05
% 3.41/1.87 Main loop : 0.23
% 3.41/1.87 Inferencing : 0.07
% 3.41/1.87 Reduction : 0.08
% 3.41/1.87 Demodulation : 0.06
% 3.41/1.87 BG Simplification : 0.02
% 3.41/1.87 Subsumption : 0.04
% 3.41/1.87 Abstraction : 0.01
% 3.41/1.87 MUC search : 0.00
% 3.41/1.87 Cooper : 0.00
% 3.41/1.87 Total : 0.82
% 3.41/1.87 Index Insertion : 0.00
% 3.41/1.87 Index Deletion : 0.00
% 3.41/1.87 Index Matching : 0.00
% 3.41/1.87 BG Taut test : 0.00
%------------------------------------------------------------------------------