TSTP Solution File: NUN069+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : NUN069+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/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 : n013.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.59s 1.83s
% Output : CNFRefutation 3.71s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 30
% Syntax : Number of formulae : 39 ( 7 unt; 25 typ; 0 def)
% Number of atoms : 29 ( 0 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 25 ( 10 ~; 5 |; 10 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 2 ( 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 : 20 ( 20 usr; 1 con; 0-2 aty)
% Number of variables : 24 (; 15 !; 9 ?; 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_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(id,type,
id: ( $i * $i ) > $o ).
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_196,axiom,
! [X1,X8] :
? [Y4] :
( ? [Y5] :
( id(Y5,Y4)
& ? [Y15] :
( r2(X8,Y15)
& r3(X1,Y15,Y5) ) )
& ? [Y7] :
( r2(Y7,Y4)
& r3(X1,X8,Y7) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/NUM009+0.ax',axiom_1a) ).
tff(f_101,axiom,
! [X20] : id(X20,X20),
file('/export/starexec/sandbox/benchmark/Axioms/NUM009+0.ax',axiom_5) ).
tff(f_272,negated_conjecture,
~ ? [Y1] :
( id(Y1,Y1)
& ? [Y2] :
( r1(Y2)
& r2(Y2,Y1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',oneidone) ).
tff(f_231,axiom,
! [X4] :
? [Y9] :
( id(Y9,X4)
& ? [Y16] :
( r1(Y16)
& r3(X4,Y16,Y9) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/NUM009+0.ax',axiom_4a) ).
tff(f_63,axiom,
? [Y24] :
! [X19] :
( ( id(X19,Y24)
& r1(X19) )
| ( ~ r1(X19)
& ~ id(X19,Y24) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/NUM009+0.ax',axiom_1) ).
tff(c_139,plain,
! [X8_120,X1_121] : r2(X8_120,'#skF_7'(X1_121,X8_120)),
inference(cnfTransformation,[status(thm)],[f_196]) ).
tff(c_34,plain,
! [X20_23] : id(X20_23,X20_23),
inference(cnfTransformation,[status(thm)],[f_101]) ).
tff(c_118,plain,
! [Y2_110,Y1_108] :
( ~ r2(Y2_110,Y1_108)
| ~ r1(Y2_110)
| ~ id(Y1_108,Y1_108) ),
inference(cnfTransformation,[status(thm)],[f_272]) ).
tff(c_120,plain,
! [Y2_110,Y1_108] :
( ~ r2(Y2_110,Y1_108)
| ~ r1(Y2_110) ),
inference(demodulation,[status(thm),theory(equality)],[c_34,c_118]) ).
tff(c_143,plain,
! [X8_120] : ~ r1(X8_120),
inference(resolution,[status(thm)],[c_139,c_120]) ).
tff(c_98,plain,
! [X4_87] : id('#skF_13'(X4_87),X4_87),
inference(cnfTransformation,[status(thm)],[f_231]) ).
tff(c_126,plain,
! [X19_116] :
( r1(X19_116)
| ~ id(X19_116,'#skF_1') ),
inference(cnfTransformation,[status(thm)],[f_63]) ).
tff(c_135,plain,
r1('#skF_13'('#skF_1')),
inference(resolution,[status(thm)],[c_98,c_126]) ).
tff(c_150,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_143,c_135]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.14 % Problem : NUN069+1 : TPTP v8.1.2. Released v7.3.0.
% 0.14/0.15 % 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.14/0.36 % Computer : n013.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Thu Aug 3 18:34:32 EDT 2023
% 0.14/0.36 % CPUTime :
% 3.59/1.83 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.59/1.83
% 3.59/1.83 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 3.71/1.86
% 3.71/1.86 Inference rules
% 3.71/1.86 ----------------------
% 3.71/1.86 #Ref : 0
% 3.71/1.86 #Sup : 3
% 3.71/1.86 #Fact : 0
% 3.71/1.86 #Define : 0
% 3.71/1.86 #Split : 0
% 3.71/1.86 #Chain : 0
% 3.71/1.86 #Close : 0
% 3.71/1.86
% 3.71/1.86 Ordering : KBO
% 3.71/1.86
% 3.71/1.86 Simplification rules
% 3.71/1.86 ----------------------
% 3.71/1.86 #Subsume : 1
% 3.71/1.86 #Demod : 1
% 3.71/1.86 #Tautology : 16
% 3.71/1.86 #SimpNegUnit : 6
% 3.71/1.86 #BackRed : 6
% 3.71/1.86
% 3.71/1.86 #Partial instantiations: 0
% 3.71/1.86 #Strategies tried : 1
% 3.71/1.86
% 3.71/1.86 Timing (in seconds)
% 3.71/1.86 ----------------------
% 3.71/1.86 Preprocessing : 0.54
% 3.71/1.86 Parsing : 0.28
% 3.71/1.86 CNF conversion : 0.05
% 3.71/1.86 Main loop : 0.24
% 3.71/1.86 Inferencing : 0.07
% 3.71/1.86 Reduction : 0.08
% 3.71/1.86 Demodulation : 0.06
% 3.71/1.86 BG Simplification : 0.03
% 3.71/1.86 Subsumption : 0.06
% 3.71/1.86 Abstraction : 0.01
% 3.71/1.86 MUC search : 0.00
% 3.71/1.87 Cooper : 0.00
% 3.71/1.87 Total : 0.83
% 3.71/1.87 Index Insertion : 0.00
% 3.71/1.87 Index Deletion : 0.00
% 3.71/1.87 Index Matching : 0.00
% 3.71/1.87 BG Taut test : 0.00
%------------------------------------------------------------------------------