TSTP Solution File: NUN089+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : NUN089+1 : 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 : n022.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 4.00s 1.95s
% Output : CNFRefutation 4.00s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 35
% Syntax : Number of formulae : 52 ( 9 unt; 29 typ; 0 def)
% Number of atoms : 48 ( 0 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 54 ( 29 ~; 21 |; 4 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 40 ( 24 >; 16 *; 0 +; 0 <<)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-3 aty)
% Number of functors : 24 ( 24 usr; 5 con; 0-2 aty)
% Number of variables : 26 (; 25 !; 1 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ r4 > r3 > r2 > id > 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(id,type,
id: ( $i * $i ) > $o ).
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_283,negated_conjecture,
~ ! [Y1] :
( ! [Y2] :
( ! [Y3] :
( ~ r1(Y3)
| ~ r2(Y3,Y2) )
| ~ r2(Y2,Y1) )
| ! [Y4] :
( ~ id(Y4,Y1)
| ~ r1(Y4) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',zerounidtwo) ).
tff(f_106,axiom,
! [X21,X22] :
( ~ id(X21,X22)
| id(X22,X21) ),
file('/export/starexec/sandbox2/benchmark/Axioms/NUM009+0.ax',axiom_6) ).
tff(f_127,axiom,
! [X26,X27] :
( ~ id(X26,X27)
| ( ~ r1(X26)
& ~ r1(X27) )
| ( r1(X26)
& r1(X27) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/NUM009+0.ax',axiom_8) ).
tff(f_101,axiom,
! [X20] : id(X20,X20),
file('/export/starexec/sandbox2/benchmark/Axioms/NUM009+0.ax',axiom_5) ).
tff(f_63,axiom,
? [Y24] :
! [X19] :
( ( id(X19,Y24)
& r1(X19) )
| ( ~ r1(X19)
& ~ id(X19,Y24) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/NUM009+0.ax',axiom_1) ).
tff(f_262,axiom,
! [X7,Y10] :
( ! [Y20] :
( ~ id(Y20,Y10)
| ~ r1(Y20) )
| ~ r2(X7,Y10) ),
file('/export/starexec/sandbox2/benchmark/Axioms/NUM009+0.ax',axiom_7a) ).
tff(c_118,plain,
r1('#skF_24'),
inference(cnfTransformation,[status(thm)],[f_283]) ).
tff(c_120,plain,
id('#skF_24','#skF_21'),
inference(cnfTransformation,[status(thm)],[f_283]) ).
tff(c_155,plain,
! [X22_131,X21_132] :
( id(X22_131,X21_132)
| ~ id(X21_132,X22_131) ),
inference(cnfTransformation,[status(thm)],[f_106]) ).
tff(c_171,plain,
id('#skF_21','#skF_24'),
inference(resolution,[status(thm)],[c_120,c_155]) ).
tff(c_215,plain,
! [X27_140,X26_141] :
( ~ r1(X27_140)
| r1(X26_141)
| ~ id(X26_141,X27_140) ),
inference(cnfTransformation,[status(thm)],[f_127]) ).
tff(c_227,plain,
( ~ r1('#skF_24')
| r1('#skF_21') ),
inference(resolution,[status(thm)],[c_171,c_215]) ).
tff(c_250,plain,
r1('#skF_21'),
inference(demodulation,[status(thm),theory(equality)],[c_118,c_227]) ).
tff(c_34,plain,
! [X20_23] : id(X20_23,X20_23),
inference(cnfTransformation,[status(thm)],[f_101]) ).
tff(c_132,plain,
! [X19_118] :
( r1(X19_118)
| ~ id(X19_118,'#skF_1') ),
inference(cnfTransformation,[status(thm)],[f_63]) ).
tff(c_142,plain,
r1('#skF_1'),
inference(resolution,[status(thm)],[c_34,c_132]) ).
tff(c_8,plain,
! [X19_2] :
( id(X19_2,'#skF_1')
| ~ r1(X19_2) ),
inference(cnfTransformation,[status(thm)],[f_63]) ).
tff(c_167,plain,
! [X19_2] :
( id('#skF_1',X19_2)
| ~ r1(X19_2) ),
inference(resolution,[status(thm)],[c_8,c_155]) ).
tff(c_122,plain,
r2('#skF_22','#skF_21'),
inference(cnfTransformation,[status(thm)],[f_283]) ).
tff(c_411,plain,
! [X7_160,Y10_161,Y20_162] :
( ~ r2(X7_160,Y10_161)
| ~ r1(Y20_162)
| ~ id(Y20_162,Y10_161) ),
inference(cnfTransformation,[status(thm)],[f_262]) ).
tff(c_433,plain,
! [Y20_163] :
( ~ r1(Y20_163)
| ~ id(Y20_163,'#skF_21') ),
inference(resolution,[status(thm)],[c_122,c_411]) ).
tff(c_441,plain,
( ~ r1('#skF_1')
| ~ r1('#skF_21') ),
inference(resolution,[status(thm)],[c_167,c_433]) ).
tff(c_457,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_250,c_142,c_441]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : NUN089+1 : TPTP v8.1.2. Released v7.3.0.
% 0.00/0.13 % 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.34 % Computer : n022.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Thu Aug 3 18:35:33 EDT 2023
% 0.21/0.34 % CPUTime :
% 4.00/1.95 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 4.00/1.96
% 4.00/1.96 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 4.00/1.99
% 4.00/1.99 Inference rules
% 4.00/1.99 ----------------------
% 4.00/1.99 #Ref : 0
% 4.00/1.99 #Sup : 69
% 4.00/1.99 #Fact : 0
% 4.00/1.99 #Define : 0
% 4.00/1.99 #Split : 1
% 4.00/1.99 #Chain : 0
% 4.00/1.99 #Close : 0
% 4.00/1.99
% 4.00/1.99 Ordering : KBO
% 4.00/1.99
% 4.00/1.99 Simplification rules
% 4.00/1.99 ----------------------
% 4.00/1.99 #Subsume : 4
% 4.00/1.99 #Demod : 26
% 4.00/1.99 #Tautology : 38
% 4.00/1.99 #SimpNegUnit : 0
% 4.00/1.99 #BackRed : 0
% 4.00/1.99
% 4.00/1.99 #Partial instantiations: 0
% 4.00/1.99 #Strategies tried : 1
% 4.00/1.99
% 4.00/1.99 Timing (in seconds)
% 4.00/1.99 ----------------------
% 4.00/1.99 Preprocessing : 0.54
% 4.00/1.99 Parsing : 0.29
% 4.00/1.99 CNF conversion : 0.05
% 4.00/1.99 Main loop : 0.38
% 4.00/1.99 Inferencing : 0.16
% 4.00/1.99 Reduction : 0.10
% 4.00/1.99 Demodulation : 0.08
% 4.00/1.99 BG Simplification : 0.03
% 4.00/1.99 Subsumption : 0.08
% 4.00/1.99 Abstraction : 0.01
% 4.00/1.99 MUC search : 0.00
% 4.00/1.99 Cooper : 0.00
% 4.00/1.99 Total : 0.98
% 4.00/1.99 Index Insertion : 0.00
% 4.00/1.99 Index Deletion : 0.00
% 4.00/1.99 Index Matching : 0.00
% 4.00/1.99 BG Taut test : 0.00
%------------------------------------------------------------------------------