TSTP Solution File: ARI119_1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : ARI119_1 : TPTP v8.1.2. Released v5.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 : n023.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:33:15 EDT 2023
% Result : Theorem 5.92s 2.54s
% Output : CNFRefutation 6.34s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 5
% Syntax : Number of formulae : 29 ( 21 unt; 1 typ; 0 def)
% Number of atoms : 36 ( 35 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 17 ( 9 ~; 6 |; 2 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number arithmetic : 156 ( 0 atm; 67 fun; 62 num; 27 var)
% Number of types : 1 ( 0 usr; 1 ari)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 12 ( 1 usr; 9 con; 0-2 aty)
% Number of variables : 27 (; 25 !; 2 ?; 27 :)
% Comments :
%------------------------------------------------------------------------------
%$ #nlpp
%Foreground sorts:
%Background operators:
tff('#skE_1',type,
'#skE_1': $int ).
%Foreground operators:
tff(f_34,negated_conjecture,
~ ? [Xa: $int,Ya: $int] :
( ( $product(Xa,Ya) = 16 )
& ( Xa = 4 )
& ( Ya = 4 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',product_4_4_16) ).
tff(f_135,axiom,
! [M: $int,N: $int] : ( $product($sum(1,M),N) = $sum(N,$product(M,N)) ),
file('/export/starexec/sandbox2/solver/bin/lemmas/mult_lemmas.p',mult_def_2) ).
tff(f_138,axiom,
! [A: $int,B: $int] : ( $product(A,B) = $product(B,A) ),
file('/export/starexec/sandbox2/solver/bin/lemmas/mult_lemmas.p',mult_comm) ).
tff(f_140,axiom,
! [A: $int,B: $int,C: $int] : ( $product(A,$sum(B,C)) = $sum($product(A,B),$product(A,C)) ),
file('/export/starexec/sandbox2/solver/bin/lemmas/mult_lemmas.p',mult_dist) ).
tff(c_26,plain,
$product(4,4) != 16,
inference(cnfTransformation,[status(thm)],[f_34]) ).
tff(c_42,plain,
$product(4,4) = '#skE_1',
inference(define,[status(thm),theory(equality)],[c_26]) ).
tff(c_46,plain,
'#skE_1' != 16,
inference(demodulation,[status(thm),theory(equality)],[c_42,c_26]) ).
tff(c_45,plain,
$product(4,4) = '#skE_1',
inference(define,[status(thm),theory(equality)],[c_26]) ).
tff(c_38,plain,
! [X_33: $int,N_6: $int,M_5: $int] :
( ( $product(X_33,N_6) = $sum(N_6,$product(M_5,N_6)) )
| ( X_33 != $sum(1,M_5) ) ),
inference(cnfTransformation,[status(thm)],[f_135]) ).
tff(c_92,plain,
$product($sum(1,4),4) = $sum(4,'#skE_1'),
inference(superposition,[status(thm),theory(equality)],[c_45,c_38]) ).
tff(c_94,plain,
$product(5,4) = $sum(4,'#skE_1'),
inference(backgroundSimplification,[status(thm),theory('LIA')],[c_92]) ).
tff(c_36,plain,
! [B_9: $int,A_10: $int] : ( $product(B_9,A_10) = $product(A_10,B_9) ),
inference(cnfTransformation,[status(thm)],[f_138]) ).
tff(c_192,plain,
$product(4,5) = $sum(4,'#skE_1'),
inference(superposition,[status(thm),theory(equality)],[c_94,c_36]) ).
tff(c_10,plain,
! [A_11: $int,C_13: $int,B_12: $int] : ( $product(A_11,$sum(C_13,B_12)) = $sum($product(A_11,B_12),$product(A_11,C_13)) ),
inference(cnfTransformation,[status(thm)],[f_140]) ).
tff(c_35,plain,
! [A_14: $int,X_32: $int,B_15: $int,C_16: $int] :
( ( $product(A_14,X_32) = $sum($product(A_14,B_15),$product(A_14,C_16)) )
| ( X_32 != $sum(B_15,C_16) ) ),
inference(backgroundSimplification,[status(thm),theory('LRFIA')],[c_10]) ).
tff(c_237,plain,
! [C_51: $int,X_52: $int] :
( ( $sum('#skE_1',$product(4,C_51)) = $product(4,X_52) )
| ( X_52 != $sum(4,C_51) ) ),
inference(superposition,[status(thm),theory(equality)],[c_45,c_35]) ).
tff(c_463,plain,
! [A_10: $int,X_52: $int] :
( ( $sum('#skE_1',$product(A_10,4)) = $product(4,X_52) )
| ( X_52 != $sum(4,A_10) ) ),
inference(superposition,[status(thm),theory(equality)],[c_36,c_237]) ).
tff(c_2480,plain,
! [A_10: $int] :
( ( $sum('#skE_1',$product(A_10,4)) = $sum(4,'#skE_1') )
| ( $sum(4,A_10) != 5 ) ),
inference(superposition,[status(thm),theory(equality)],[c_192,c_463]) ).
tff(c_2483,plain,
$product(1,4) = 4,
inference(backgroundSimplification,[status(thm),theory('LIA')],[c_2480]) ).
tff(c_2590,plain,
$product($sum(1,1),4) = $sum(4,4),
inference(superposition,[status(thm),theory(equality)],[c_2483,c_38]) ).
tff(c_2592,plain,
$product(2,4) = 8,
inference(backgroundSimplification,[status(thm),theory('LIA')],[c_2590]) ).
tff(c_3590,plain,
$product($sum(1,2),4) = $sum(4,8),
inference(superposition,[status(thm),theory(equality)],[c_2592,c_38]) ).
tff(c_3592,plain,
$product(3,4) = 12,
inference(backgroundSimplification,[status(thm),theory('LIA')],[c_3590]) ).
tff(c_50,plain,
! [M_5: $int] :
( ( $sum(4,$product(M_5,4)) = '#skE_1' )
| ( $sum(1,M_5) != 4 ) ),
inference(superposition,[status(thm),theory(equality)],[c_45,c_38]) ).
tff(c_91,plain,
$product(3,4) = $sum($uminus(4),'#skE_1'),
inference(backgroundSimplification,[status(thm),theory('LIA')],[c_50]) ).
tff(c_5569,plain,
$sum($uminus(4),'#skE_1') = 12,
inference(demodulation,[status(thm),theory(equality)],[c_3592,c_91]) ).
tff(c_5571,plain,
'#skE_1' = 16,
inference(backgroundSimplification,[status(thm),theory('LIA')],[c_5569]) ).
tff(c_5573,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_46,c_5571]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13 % Problem : ARI119_1 : TPTP v8.1.2. Released v5.0.0.
% 0.12/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.35 % Computer : n023.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Fri Aug 4 00:27:37 EDT 2023
% 0.14/0.35 % CPUTime :
% 5.92/2.54 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 5.92/2.55
% 5.92/2.55 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 6.34/2.58
% 6.34/2.58 Inference rules
% 6.34/2.58 ----------------------
% 6.34/2.58 #Ref : 0
% 6.34/2.58 #Sup : 907
% 6.34/2.58 #Fact : 0
% 6.34/2.58 #Define : 1
% 6.34/2.58 #Split : 0
% 6.34/2.58 #Chain : 0
% 6.34/2.58 #Close : 0
% 6.34/2.58
% 6.34/2.58 Ordering : LPO
% 6.34/2.58
% 6.34/2.58 Simplification rules
% 6.34/2.58 ----------------------
% 6.34/2.58 #Subsume : 27
% 6.34/2.58 #Demod : 358
% 6.34/2.58 #Tautology : 402
% 6.34/2.58 #SimpNegUnit : 1
% 6.34/2.58 #BackRed : 1
% 6.34/2.58
% 6.34/2.58 #Partial instantiations: 0
% 6.34/2.58 #Strategies tried : 1
% 6.34/2.58
% 6.34/2.58 Timing (in seconds)
% 6.34/2.58 ----------------------
% 6.34/2.58 Preprocessing : 0.51
% 6.34/2.58 Parsing : 0.28
% 6.34/2.58 CNF conversion : 0.03
% 6.34/2.58 Main loop : 0.97
% 6.34/2.58 Inferencing : 0.23
% 6.34/2.58 Reduction : 0.33
% 6.34/2.58 Demodulation : 0.26
% 6.34/2.58 BG Simplification : 0.15
% 6.34/2.58 Subsumption : 0.16
% 6.34/2.58 Abstraction : 0.05
% 6.34/2.58 MUC search : 0.00
% 6.34/2.58 Cooper : 0.02
% 6.34/2.58 Total : 1.53
% 6.34/2.58 Index Insertion : 0.00
% 6.34/2.58 Index Deletion : 0.00
% 6.34/2.58 Index Matching : 0.00
% 6.34/2.58 BG Taut test : 0.00
%------------------------------------------------------------------------------