TSTP Solution File: NUN073+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : NUN073+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 : n020.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:23 EDT 2023
% Result : Theorem 5.97s 2.39s
% Output : CNFRefutation 6.03s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 33
% Syntax : Number of formulae : 46 ( 8 unt; 30 typ; 0 def)
% Number of atoms : 35 ( 0 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 44 ( 25 ~; 19 |; 0 &)
% ( 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 : 25 ( 25 usr; 6 con; 0-2 aty)
% Number of variables : 22 (; 22 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ r4 > r3 > r2 > id > r1 > #nlpp > #skF_11 > #skF_16 > #skF_6 > #skF_2 > #skF_18 > #skF_19 > #skF_25 > #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_25',type,
'#skF_25': $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_287,negated_conjecture,
~ ! [Y1] :
( ! [Y2] :
( ! [Y4] :
( ~ r1(Y4)
| ~ r2(Y4,Y2) )
| ~ id(Y2,Y1) )
| ! [Y3] :
( ! [Y5] :
( ~ r1(Y5)
| ~ r2(Y5,Y3) )
| ~ r2(Y3,Y1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',oneunidtwo) ).
tff(f_223,axiom,
! [X3,X10] :
( ! [Y12] :
( ! [Y13] :
( ~ id(Y13,Y12)
| ~ r2(X3,Y13) )
| ~ r2(X10,Y12) )
| id(X3,X10) ),
file('/export/starexec/sandbox/benchmark/Axioms/NUM009+0.ax',axiom_3a) ).
tff(f_262,axiom,
! [X7,Y10] :
( ! [Y20] :
( ~ id(Y20,Y10)
| ~ r1(Y20) )
| ~ r2(X7,Y10) ),
file('/export/starexec/sandbox/benchmark/Axioms/NUM009+0.ax',axiom_7a) ).
tff(c_128,plain,
r1('#skF_23'),
inference(cnfTransformation,[status(thm)],[f_287]) ).
tff(c_124,plain,
id('#skF_22','#skF_21'),
inference(cnfTransformation,[status(thm)],[f_287]) ).
tff(c_126,plain,
r2('#skF_23','#skF_22'),
inference(cnfTransformation,[status(thm)],[f_287]) ).
tff(c_118,plain,
r2('#skF_24','#skF_21'),
inference(cnfTransformation,[status(thm)],[f_287]) ).
tff(c_1735,plain,
! [X3_256,X10_257,Y12_258,Y13_259] :
( id(X3_256,X10_257)
| ~ r2(X10_257,Y12_258)
| ~ r2(X3_256,Y13_259)
| ~ id(Y13_259,Y12_258) ),
inference(cnfTransformation,[status(thm)],[f_223]) ).
tff(c_2338,plain,
! [X3_296,Y13_297] :
( id(X3_296,'#skF_24')
| ~ r2(X3_296,Y13_297)
| ~ id(Y13_297,'#skF_21') ),
inference(resolution,[status(thm)],[c_118,c_1735]) ).
tff(c_2377,plain,
( id('#skF_23','#skF_24')
| ~ id('#skF_22','#skF_21') ),
inference(resolution,[status(thm)],[c_126,c_2338]) ).
tff(c_2394,plain,
id('#skF_23','#skF_24'),
inference(demodulation,[status(thm),theory(equality)],[c_124,c_2377]) ).
tff(c_120,plain,
r2('#skF_25','#skF_24'),
inference(cnfTransformation,[status(thm)],[f_287]) ).
tff(c_452,plain,
! [X7_171,Y10_172,Y20_173] :
( ~ r2(X7_171,Y10_172)
| ~ r1(Y20_173)
| ~ id(Y20_173,Y10_172) ),
inference(cnfTransformation,[status(thm)],[f_262]) ).
tff(c_478,plain,
! [Y20_173] :
( ~ r1(Y20_173)
| ~ id(Y20_173,'#skF_24') ),
inference(resolution,[status(thm)],[c_120,c_452]) ).
tff(c_2401,plain,
~ r1('#skF_23'),
inference(resolution,[status(thm)],[c_2394,c_478]) ).
tff(c_2415,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_128,c_2401]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.14 % Problem : NUN073+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.15/0.36 % Computer : n020.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Thu Aug 3 18:37:37 EDT 2023
% 0.15/0.37 % CPUTime :
% 5.97/2.39 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 5.97/2.40
% 5.97/2.40 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 6.03/2.43
% 6.03/2.43 Inference rules
% 6.03/2.43 ----------------------
% 6.03/2.43 #Ref : 0
% 6.03/2.43 #Sup : 522
% 6.03/2.43 #Fact : 0
% 6.03/2.43 #Define : 0
% 6.03/2.43 #Split : 10
% 6.03/2.43 #Chain : 0
% 6.03/2.43 #Close : 0
% 6.03/2.43
% 6.03/2.43 Ordering : KBO
% 6.03/2.43
% 6.03/2.43 Simplification rules
% 6.03/2.43 ----------------------
% 6.03/2.43 #Subsume : 133
% 6.03/2.43 #Demod : 104
% 6.03/2.43 #Tautology : 98
% 6.03/2.43 #SimpNegUnit : 29
% 6.03/2.43 #BackRed : 1
% 6.03/2.43
% 6.03/2.43 #Partial instantiations: 0
% 6.03/2.43 #Strategies tried : 1
% 6.03/2.43
% 6.03/2.43 Timing (in seconds)
% 6.03/2.43 ----------------------
% 6.03/2.43 Preprocessing : 0.56
% 6.03/2.43 Parsing : 0.29
% 6.03/2.43 CNF conversion : 0.06
% 6.03/2.43 Main loop : 0.78
% 6.03/2.43 Inferencing : 0.29
% 6.03/2.43 Reduction : 0.22
% 6.03/2.43 Demodulation : 0.16
% 6.03/2.43 BG Simplification : 0.04
% 6.03/2.43 Subsumption : 0.16
% 6.03/2.43 Abstraction : 0.02
% 6.03/2.43 MUC search : 0.00
% 6.03/2.43 Cooper : 0.00
% 6.03/2.43 Total : 1.38
% 6.03/2.43 Index Insertion : 0.00
% 6.03/2.43 Index Deletion : 0.00
% 6.03/2.43 Index Matching : 0.00
% 6.03/2.43 BG Taut test : 0.00
%------------------------------------------------------------------------------