TSTP Solution File: ARI705_1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : ARI705_1 : TPTP v8.1.2. Released v6.3.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 : n022.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:34:16 EDT 2023
% Result : Theorem 2.78s 1.65s
% Output : CNFRefutation 2.78s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 8
% Syntax : Number of formulae : 16 ( 11 unt; 4 typ; 0 def)
% Number of atoms : 14 ( 13 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 6 ( 4 ~; 1 |; 0 &)
% ( 1 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 2 avg)
% Maximal term depth : 5 ( 2 avg)
% Number arithmetic : 45 ( 0 atm; 26 fun; 12 num; 7 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 : 9 ( 4 usr; 7 con; 0-2 aty)
% Number of variables : 7 (; 7 !; 0 ?; 7 :)
% Comments :
%------------------------------------------------------------------------------
%$ #nlpp
%Foreground sorts:
%Background operators:
tff(c,type,
c: $int ).
tff(d,type,
d: $int ).
tff(b,type,
b: $int ).
tff(a,type,
a: $int ).
%Foreground operators:
tff(f_80,axiom,
! [C: $int,B: $int] :
( ( $product(C,B) = C )
<=> ( ( C = 0 )
| ( B = 1 ) ) ),
file('/export/starexec/sandbox2/solver/bin/lemmas/mult_lemmas.p',mult_cancel_right1) ).
tff(f_64,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_30,axiom,
$product(d,d) = $sum($product(d,d),a),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',eq) ).
tff(f_32,negated_conjecture,
$product($product($product($product(d,c),a),b),2) != 0,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj) ).
tff(c_36,plain,
! [B_24: $int] : ( $product(0,B_24) = 0 ),
inference(cnfTransformation,[status(thm)],[f_80]) ).
tff(c_44,plain,
! [B_7: $int,A_8: $int] : ( $product(B_7,A_8) = $product(A_8,B_7) ),
inference(cnfTransformation,[status(thm)],[f_64]) ).
tff(c_2,plain,
$sum($product(d,d),a) = $product(d,d),
inference(cnfTransformation,[status(thm)],[f_30]) ).
tff(c_34,plain,
a = 0,
inference(backgroundSimplification,[status(thm),theory('LRFIA')],[c_2]) ).
tff(c_5,plain,
$product($product($product($product(d,c),a),b),2) != 0,
inference(cnfTransformation,[status(thm)],[f_32]) ).
tff(c_33,plain,
$product($product($product(d,c),a),b) != 0,
inference(backgroundSimplification,[status(thm),theory('LRFIA')],[c_5]) ).
tff(c_53,plain,
$product($product($product(d,c),0),b) != 0,
inference(demodulation,[status(thm),theory(equality)],[c_34,c_33]) ).
tff(c_60,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_36,c_36,c_44,c_44,c_53]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : ARI705_1 : TPTP v8.1.2. Released v6.3.0.
% 0.00/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.13/0.35 % Computer : n022.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 : Fri Aug 4 00:07:18 EDT 2023
% 0.13/0.35 % CPUTime :
% 2.78/1.65 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.78/1.65
% 2.78/1.65 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 2.78/1.69
% 2.78/1.69 Inference rules
% 2.78/1.69 ----------------------
% 2.78/1.69 #Ref : 0
% 2.78/1.69 #Sup : 0
% 2.78/1.69 #Fact : 0
% 2.78/1.69 #Define : 0
% 2.78/1.69 #Split : 0
% 2.78/1.69 #Chain : 0
% 2.78/1.69 #Close : 0
% 2.78/1.69
% 2.78/1.69 Ordering : LPO
% 2.78/1.69
% 2.78/1.69 Simplification rules
% 2.78/1.69 ----------------------
% 2.78/1.69 #Subsume : 0
% 2.78/1.69 #Demod : 5
% 2.78/1.69 #Tautology : 0
% 2.78/1.69 #SimpNegUnit : 0
% 2.78/1.69 #BackRed : 0
% 2.78/1.69
% 2.78/1.69 #Partial instantiations: 0
% 2.78/1.69 #Strategies tried : 1
% 2.78/1.69
% 2.78/1.69 Timing (in seconds)
% 2.78/1.69 ----------------------
% 2.78/1.69 Preprocessing : 0.54
% 2.78/1.69 Parsing : 0.29
% 2.78/1.69 CNF conversion : 0.03
% 2.78/1.69 Main loop : 0.08
% 2.78/1.69 Inferencing : 0.00
% 2.78/1.69 Reduction : 0.03
% 2.78/1.69 Demodulation : 0.02
% 2.78/1.69 BG Simplification : 0.04
% 2.78/1.69 Subsumption : 0.02
% 2.78/1.69 Abstraction : 0.01
% 2.78/1.69 MUC search : 0.00
% 2.78/1.69 Cooper : 0.01
% 2.78/1.69 Total : 0.68
% 2.78/1.69 Index Insertion : 0.00
% 2.78/1.69 Index Deletion : 0.00
% 2.78/1.69 Index Matching : 0.00
% 2.78/1.69 BG Taut test : 0.00
%------------------------------------------------------------------------------