TSTP Solution File: NUN067+2 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : NUN067+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/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 : n002.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:21 EDT 2023
% Result : Theorem 2.69s 1.66s
% Output : CNFRefutation 2.69s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 28
% Syntax : Number of formulae : 35 ( 6 unt; 25 typ; 0 def)
% Number of atoms : 18 ( 4 equ)
% Maximal formula atoms : 5 ( 1 avg)
% Number of connectives : 17 ( 9 ~; 4 |; 4 &)
% ( 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 : 39 ( 24 >; 15 *; 0 +; 0 <<)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-3 aty)
% Number of functors : 21 ( 21 usr; 1 con; 0-2 aty)
% Number of variables : 20 (; 15 !; 5 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ r4 > r3 > r2 > r1 > #nlpp > #skF_11 > #skF_21 > #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_21',type,
'#skF_21': $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_190,negated_conjecture,
~ ? [Y1] :
! [Y2] :
( ~ r1(Y2)
| ( Y1 != Y2 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',nonzerosexist) ).
tff(f_180,axiom,
! [X7,Y10] :
( ! [Y20] :
( ~ r1(Y20)
| ( Y20 != Y10 ) )
| ~ r2(X7,Y10) ),
file('/export/starexec/sandbox/benchmark/Axioms/NUM008+0.ax',axiom_7a) ).
tff(f_128,axiom,
! [X2,X9] :
? [Y2] :
( ? [Y3] :
( ? [Y14] :
( r2(X9,Y14)
& r4(X2,Y14,Y3) )
& ( Y3 = Y2 ) )
& ? [Y6] :
( r3(Y6,X2,Y2)
& r4(X2,X9,Y6) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/NUM008+0.ax',axiom_2a) ).
tff(c_84,plain,
! [Y1_84] : ( '#skF_21'(Y1_84) = Y1_84 ),
inference(cnfTransformation,[status(thm)],[f_190]) ).
tff(c_86,plain,
! [Y1_84] : r1('#skF_21'(Y1_84)),
inference(cnfTransformation,[status(thm)],[f_190]) ).
tff(c_87,plain,
! [Y1_84] : r1(Y1_84),
inference(demodulation,[status(thm),theory(equality)],[c_84,c_86]) ).
tff(c_82,plain,
! [X7_80,Y20_83] :
( ~ r2(X7_80,Y20_83)
| ~ r1(Y20_83) ),
inference(cnfTransformation,[status(thm)],[f_180]) ).
tff(c_89,plain,
! [X7_80,Y20_83] : ~ r2(X7_80,Y20_83),
inference(demodulation,[status(thm),theory(equality)],[c_87,c_82]) ).
tff(c_56,plain,
! [X9_40,X2_39] : r2(X9_40,'#skF_11'(X2_39,X9_40)),
inference(cnfTransformation,[status(thm)],[f_128]) ).
tff(c_100,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_89,c_56]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.14 % Problem : NUN067+2 : TPTP v8.1.2. Released v7.3.0.
% 0.00/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 : n002.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:53:16 EDT 2023
% 0.15/0.36 % CPUTime :
% 2.69/1.66 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.69/1.66
% 2.69/1.66 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 2.69/1.68
% 2.69/1.68 Inference rules
% 2.69/1.68 ----------------------
% 2.69/1.68 #Ref : 0
% 2.69/1.68 #Sup : 0
% 2.69/1.68 #Fact : 0
% 2.69/1.68 #Define : 0
% 2.69/1.68 #Split : 0
% 2.69/1.68 #Chain : 0
% 2.69/1.68 #Close : 0
% 2.69/1.68
% 2.69/1.68 Ordering : KBO
% 2.69/1.68
% 2.69/1.68 Simplification rules
% 2.69/1.68 ----------------------
% 2.69/1.68 #Subsume : 26
% 2.69/1.68 #Demod : 10
% 2.69/1.68 #Tautology : 14
% 2.69/1.68 #SimpNegUnit : 3
% 2.69/1.68 #BackRed : 0
% 2.69/1.68
% 2.69/1.68 #Partial instantiations: 0
% 2.69/1.68 #Strategies tried : 1
% 2.69/1.68
% 2.69/1.68 Timing (in seconds)
% 2.69/1.68 ----------------------
% 2.69/1.69 Preprocessing : 0.54
% 2.69/1.69 Parsing : 0.26
% 2.69/1.69 CNF conversion : 0.05
% 2.69/1.69 Main loop : 0.07
% 2.69/1.69 Inferencing : 0.00
% 2.69/1.69 Reduction : 0.03
% 2.69/1.69 Demodulation : 0.02
% 2.69/1.69 BG Simplification : 0.02
% 2.69/1.69 Subsumption : 0.03
% 2.69/1.69 Abstraction : 0.01
% 2.69/1.69 MUC search : 0.00
% 2.69/1.69 Cooper : 0.00
% 2.69/1.69 Total : 0.65
% 2.69/1.69 Index Insertion : 0.00
% 2.69/1.69 Index Deletion : 0.00
% 2.69/1.69 Index Matching : 0.00
% 2.69/1.69 BG Taut test : 0.00
%------------------------------------------------------------------------------