TSTP Solution File: SWV488+3 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SWV488+3 : TPTP v8.1.2. Released v4.0.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 : n018.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 11:04:20 EDT 2023
% Result : Theorem 4.27s 2.11s
% Output : CNFRefutation 4.27s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 16
% Syntax : Number of formulae : 33 ( 13 unt; 12 typ; 0 def)
% Number of atoms : 57 ( 18 equ)
% Maximal formula atoms : 17 ( 2 avg)
% Number of connectives : 56 ( 20 ~; 15 |; 12 &)
% ( 1 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 10 ( 5 >; 5 *; 0 +; 0 <<)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 7 con; 0-2 aty)
% Number of variables : 19 (; 19 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ int_less > int_leq > plus > a > #nlpp > real_zero > real_one > n > int_zero > int_one > #skF_2 > #skF_3 > #skF_1
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(int_one,type,
int_one: $i ).
tff(plus,type,
plus: ( $i * $i ) > $i ).
tff('#skF_2',type,
'#skF_2': $i ).
tff(int_zero,type,
int_zero: $i ).
tff('#skF_3',type,
'#skF_3': $i ).
tff(a,type,
a: ( $i * $i ) > $i ).
tff(real_one,type,
real_one: $i ).
tff(n,type,
n: $i ).
tff(int_leq,type,
int_leq: ( $i * $i ) > $o ).
tff(int_less,type,
int_less: ( $i * $i ) > $o ).
tff('#skF_1',type,
'#skF_1': ( $i * $i ) > $i ).
tff(real_zero,type,
real_zero: $i ).
tff(f_69,axiom,
real_zero != real_one,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',real_constants) ).
tff(f_120,negated_conjecture,
~ ! [I,J] :
( ( int_leq(int_one,J)
& int_leq(J,I)
& int_leq(I,n) )
=> ( ( I = J )
=> ( a(I,J) != real_zero ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',uti) ).
tff(f_30,axiom,
! [I,J] :
( int_leq(I,J)
<=> ( int_less(I,J)
| ( I = J ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',int_leq) ).
tff(f_108,hypothesis,
! [I,J] :
( ( int_leq(int_one,I)
& int_leq(I,n)
& int_leq(int_one,J)
& int_leq(J,n) )
=> ( ! [C] :
( ( int_less(int_zero,C)
& ( I = plus(J,C) ) )
=> ! [K] :
( ( int_leq(int_one,K)
& int_leq(K,J) )
=> ( a(plus(K,C),K) = real_zero ) ) )
& ! [K] :
( ( int_leq(int_one,K)
& int_leq(K,J) )
=> ( a(K,K) = real_one ) )
& ! [C] :
( ( int_less(int_zero,C)
& ( J = plus(I,C) ) )
=> ! [K] :
( ( int_leq(int_one,K)
& int_leq(K,I) )
=> ( a(K,plus(K,C)) = real_zero ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',qii) ).
tff(c_32,plain,
real_zero != real_one,
inference(cnfTransformation,[status(thm)],[f_69]) ).
tff(c_48,plain,
int_leq(int_one,'#skF_3'),
inference(cnfTransformation,[status(thm)],[f_120]) ).
tff(c_42,plain,
'#skF_2' = '#skF_3',
inference(cnfTransformation,[status(thm)],[f_120]) ).
tff(c_40,plain,
a('#skF_2','#skF_3') = real_zero,
inference(cnfTransformation,[status(thm)],[f_120]) ).
tff(c_51,plain,
a('#skF_3','#skF_3') = real_zero,
inference(demodulation,[status(thm),theory(equality)],[c_42,c_40]) ).
tff(c_44,plain,
int_leq('#skF_2',n),
inference(cnfTransformation,[status(thm)],[f_120]) ).
tff(c_50,plain,
int_leq('#skF_3',n),
inference(demodulation,[status(thm),theory(equality)],[c_42,c_44]) ).
tff(c_4,plain,
! [J_2] : int_leq(J_2,J_2),
inference(cnfTransformation,[status(thm)],[f_30]) ).
tff(c_36,plain,
! [K_35,J_24,I_23] :
( ( a(K_35,K_35) = real_one )
| ~ int_leq(K_35,J_24)
| ~ int_leq(int_one,K_35)
| ~ int_leq(J_24,n)
| ~ int_leq(int_one,J_24)
| ~ int_leq(I_23,n)
| ~ int_leq(int_one,I_23) ),
inference(cnfTransformation,[status(thm)],[f_108]) ).
tff(c_633,plain,
! [I_84] :
( ~ int_leq(I_84,n)
| ~ int_leq(int_one,I_84) ),
inference(splitLeft,[status(thm)],[c_36]) ).
tff(c_649,plain,
~ int_leq(int_one,'#skF_3'),
inference(resolution,[status(thm)],[c_50,c_633]) ).
tff(c_657,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_48,c_649]) ).
tff(c_857,plain,
! [K_96,J_97] :
( ( a(K_96,K_96) = real_one )
| ~ int_leq(K_96,J_97)
| ~ int_leq(int_one,K_96)
| ~ int_leq(J_97,n)
| ~ int_leq(int_one,J_97) ),
inference(splitRight,[status(thm)],[c_36]) ).
tff(c_1621,plain,
! [J_123] :
( ( a(J_123,J_123) = real_one )
| ~ int_leq(J_123,n)
| ~ int_leq(int_one,J_123) ),
inference(resolution,[status(thm)],[c_4,c_857]) ).
tff(c_1644,plain,
( ( a('#skF_3','#skF_3') = real_one )
| ~ int_leq(int_one,'#skF_3') ),
inference(resolution,[status(thm)],[c_50,c_1621]) ).
tff(c_1652,plain,
real_zero = real_one,
inference(demodulation,[status(thm),theory(equality)],[c_48,c_51,c_1644]) ).
tff(c_1654,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_32,c_1652]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SWV488+3 : TPTP v8.1.2. Released v4.0.0.
% 0.00/0.14 % 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.35 % Computer : n018.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Thu Aug 3 23:19:06 EDT 2023
% 0.13/0.35 % CPUTime :
% 4.27/2.11 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 4.27/2.11
% 4.27/2.11 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 4.27/2.14
% 4.27/2.14 Inference rules
% 4.27/2.14 ----------------------
% 4.27/2.14 #Ref : 0
% 4.27/2.14 #Sup : 348
% 4.27/2.14 #Fact : 2
% 4.27/2.14 #Define : 0
% 4.27/2.14 #Split : 1
% 4.27/2.14 #Chain : 0
% 4.27/2.14 #Close : 0
% 4.27/2.14
% 4.27/2.14 Ordering : KBO
% 4.27/2.14
% 4.27/2.14 Simplification rules
% 4.27/2.14 ----------------------
% 4.27/2.14 #Subsume : 116
% 4.27/2.14 #Demod : 178
% 4.27/2.14 #Tautology : 84
% 4.27/2.14 #SimpNegUnit : 10
% 4.27/2.14 #BackRed : 0
% 4.27/2.14
% 4.27/2.14 #Partial instantiations: 0
% 4.27/2.14 #Strategies tried : 1
% 4.27/2.14
% 4.27/2.14 Timing (in seconds)
% 4.27/2.14 ----------------------
% 4.27/2.14 Preprocessing : 0.50
% 4.27/2.14 Parsing : 0.26
% 4.27/2.14 CNF conversion : 0.03
% 4.27/2.14 Main loop : 0.58
% 4.27/2.14 Inferencing : 0.20
% 4.27/2.14 Reduction : 0.18
% 4.27/2.14 Demodulation : 0.13
% 4.27/2.14 BG Simplification : 0.02
% 4.27/2.14 Subsumption : 0.14
% 4.27/2.14 Abstraction : 0.02
% 4.27/2.15 MUC search : 0.00
% 4.27/2.15 Cooper : 0.00
% 4.27/2.15 Total : 1.12
% 4.27/2.15 Index Insertion : 0.00
% 4.27/2.15 Index Deletion : 0.00
% 4.27/2.15 Index Matching : 0.00
% 4.27/2.15 BG Taut test : 0.00
%------------------------------------------------------------------------------