TSTP Solution File: NUN069+2 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : NUN069+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 : n010.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:22 EDT 2023
% Result : Theorem 3.07s 1.68s
% Output : CNFRefutation 3.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 27
% Syntax : Number of formulae : 32 ( 4 unt; 24 typ; 0 def)
% Number of atoms : 16 ( 4 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 14 ( 6 ~; 2 |; 6 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 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 : 20 ( 20 usr; 1 con; 0-2 aty)
% Number of variables : 13 (; 8 !; 5 ?; 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_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_190,negated_conjecture,
~ ? [Y1] :
( ( Y1 = Y1 )
& ? [Y2] :
( r1(Y2)
& r2(Y2,Y1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',oneeqone) ).
tff(f_149,axiom,
! [X4] :
? [Y9] :
( ? [Y16] :
( r1(Y16)
& r3(X4,Y16,Y9) )
& ( Y9 = X4 ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/NUM008+0.ax',axiom_4a) ).
tff(c_16,plain,
! [X11_3] : r2(X11_3,'#skF_2'(X11_3)),
inference(cnfTransformation,[status(thm)],[f_75]) ).
tff(c_138,plain,
! [Y2_95,Y1_96] :
( ~ r2(Y2_95,Y1_96)
| ~ r1(Y2_95) ),
inference(cnfTransformation,[status(thm)],[f_190]) ).
tff(c_142,plain,
! [X11_3] : ~ r1(X11_3),
inference(resolution,[status(thm)],[c_16,c_138]) ).
tff(c_64,plain,
! [X4_63] : r1('#skF_14'(X4_63)),
inference(cnfTransformation,[status(thm)],[f_149]) ).
tff(c_146,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_142,c_64]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : NUN069+2 : TPTP v8.1.2. Released v7.3.0.
% 0.00/0.12 % 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.13/0.33 % Computer : n010.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 300
% 0.13/0.33 % DateTime : Thu Aug 3 18:27:43 EDT 2023
% 0.13/0.34 % CPUTime :
% 3.07/1.68 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.07/1.69
% 3.07/1.69 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 3.15/1.71
% 3.15/1.71 Inference rules
% 3.15/1.71 ----------------------
% 3.15/1.71 #Ref : 0
% 3.15/1.71 #Sup : 11
% 3.15/1.71 #Fact : 0
% 3.15/1.71 #Define : 0
% 3.15/1.71 #Split : 0
% 3.15/1.71 #Chain : 0
% 3.15/1.71 #Close : 0
% 3.15/1.71
% 3.15/1.71 Ordering : KBO
% 3.15/1.71
% 3.15/1.71 Simplification rules
% 3.15/1.71 ----------------------
% 3.15/1.71 #Subsume : 2
% 3.15/1.71 #Demod : 6
% 3.15/1.71 #Tautology : 16
% 3.15/1.71 #SimpNegUnit : 3
% 3.15/1.71 #BackRed : 4
% 3.15/1.71
% 3.15/1.71 #Partial instantiations: 0
% 3.15/1.71 #Strategies tried : 1
% 3.15/1.71
% 3.15/1.71 Timing (in seconds)
% 3.15/1.71 ----------------------
% 3.15/1.71 Preprocessing : 0.52
% 3.15/1.71 Parsing : 0.25
% 3.15/1.71 CNF conversion : 0.05
% 3.15/1.71 Main loop : 0.17
% 3.15/1.71 Inferencing : 0.04
% 3.15/1.71 Reduction : 0.06
% 3.15/1.71 Demodulation : 0.04
% 3.15/1.71 BG Simplification : 0.02
% 3.15/1.71 Subsumption : 0.04
% 3.15/1.71 Abstraction : 0.01
% 3.15/1.71 MUC search : 0.00
% 3.15/1.72 Cooper : 0.00
% 3.15/1.72 Total : 0.73
% 3.15/1.72 Index Insertion : 0.00
% 3.16/1.72 Index Deletion : 0.00
% 3.16/1.72 Index Matching : 0.00
% 3.16/1.72 BG Taut test : 0.00
%------------------------------------------------------------------------------