TSTP Solution File: ARI695_1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : ARI695_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/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 : n012.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:15 EDT 2023
% Result : Theorem 4.35s 2.27s
% Output : CNFRefutation 4.69s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 7
% Syntax : Number of formulae : 26 ( 20 unt; 4 typ; 0 def)
% Number of atoms : 24 ( 23 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 10 ( 8 ~; 2 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 2 avg)
% Maximal term depth : 7 ( 2 avg)
% Number arithmetic : 125 ( 0 atm; 90 fun; 23 num; 12 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 : 11 ( 4 usr; 7 con; 0-2 aty)
% Number of variables : 12 (; 12 !; 0 ?; 12 :)
% Comments :
%------------------------------------------------------------------------------
%$ #nlpp
%Foreground sorts:
%Background operators:
tff(c,type,
c: $int ).
tff(d,type,
d: $int ).
tff('#skE_2',type,
'#skE_2': $int ).
tff('#skE_1',type,
'#skE_1': $int ).
%Foreground operators:
tff(f_60,axiom,
! [A: $int,B: $int] : ( $product(A,B) = $product(B,A) ),
file('/export/starexec/sandbox/solver/bin/lemmas/mult_lemmas.p',mult_comm) ).
tff(f_31,negated_conjecture,
$sum($product($product($uminus(1),d),$sum(2,c)),$product($uminus(1),$product(d,$difference($product($uminus(1),2),c)))) != 0,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj) ).
tff(f_68,axiom,
! [A: $int,B: $int] : ( $uminus($product(A,B)) = $product($uminus(A),B) ),
file('/export/starexec/sandbox/solver/bin/lemmas/mult_lemmas.p',minus_mult_left) ).
tff(c_40,plain,
! [B_7: $int,A_8: $int] : ( $product(B_7,A_8) = $product(A_8,B_7) ),
inference(cnfTransformation,[status(thm)],[f_60]) ).
tff(c_2,plain,
$sum($product($uminus(d),$sum(2,c)),$uminus($product(d,$sum($uminus(2),$uminus(c))))) != 0,
inference(cnfTransformation,[status(thm)],[f_31]) ).
tff(c_30,plain,
$product($uminus(d),$sum(2,c)) != $product(d,$sum($uminus(2),$uminus(c))),
inference(backgroundSimplification,[status(thm),theory('LRFIA')],[c_2]) ).
tff(c_52,plain,
$product($sum($uminus(2),$uminus(c)),d) != $product($sum(2,c),$uminus(d)),
inference(demodulation,[status(thm),theory(equality)],[c_40,c_40,c_30]) ).
tff(c_55,plain,
$product($sum(2,c),$uminus(d)) = '#skE_2',
inference(define,[status(thm),theory(equality)],[c_52]) ).
tff(c_54,plain,
$product($sum($uminus(2),$uminus(c)),d) = '#skE_1',
inference(define,[status(thm),theory(equality)],[c_52]) ).
tff(c_53,plain,
$product($sum($uminus(2),$uminus(c)),d) != $product($sum(2,c),$uminus(d)),
inference(demodulation,[status(thm),theory(equality)],[c_40,c_40,c_30]) ).
tff(c_66,plain,
'#skE_2' != '#skE_1',
inference(demodulation,[status(thm),theory(equality)],[c_55,c_54,c_53]) ).
tff(c_68,plain,
$product($sum(2,c),$uminus(d)) = '#skE_2',
inference(define,[status(thm),theory(equality)],[c_52]) ).
tff(c_223,plain,
$product($sum($uminus(2),$uminus(c)),d) = '#skE_1',
inference(define,[status(thm),theory(equality)],[c_52]) ).
tff(c_35,plain,
! [A_17: $int,B_18: $int,X_37: $int] :
( ( $uminus($product(A_17,B_18)) = $product(X_37,B_18) )
| ( X_37 != $uminus(A_17) ) ),
inference(cnfTransformation,[status(thm)],[f_68]) ).
tff(c_37,plain,
! [X_37: $int,B_18: $int,A_17: $int] :
( ( $uminus($product(X_37,B_18)) = $product(A_17,B_18) )
| ( X_37 != $uminus(A_17) ) ),
inference(backgroundSimplification,[status(thm),theory('LIA')],[c_35]) ).
tff(c_343,plain,
$uminus($product($uminus($sum($uminus(2),$uminus(c))),d)) = '#skE_1',
inference(superposition,[status(thm),theory(equality)],[c_223,c_37]) ).
tff(c_623,plain,
$product($sum(2,c),d) = $uminus('#skE_1'),
inference(backgroundSimplification,[status(thm),theory('LIA')],[c_343]) ).
tff(c_1047,plain,
$product(d,$sum(2,c)) = $uminus('#skE_1'),
inference(superposition,[status(thm),theory(equality)],[c_623,c_40]) ).
tff(c_1094,plain,
$uminus($product($uminus(d),$sum(2,c))) = $uminus('#skE_1'),
inference(superposition,[status(thm),theory(equality)],[c_1047,c_37]) ).
tff(c_1203,plain,
$uminus('#skE_2') = $uminus('#skE_1'),
inference(demodulation,[status(thm),theory(equality)],[c_68,c_40,c_1094]) ).
tff(c_1205,plain,
'#skE_2' = '#skE_1',
inference(backgroundSimplification,[status(thm),theory('LIA')],[c_1203]) ).
tff(c_1259,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_66,c_1205]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : ARI695_1 : TPTP v8.1.2. Released v6.3.0.
% 0.00/0.14 % 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.14/0.35 % Computer : n012.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:08:07 EDT 2023
% 0.14/0.35 % CPUTime :
% 4.35/2.27 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 4.35/2.27
% 4.35/2.27 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 4.69/2.30
% 4.69/2.30 Inference rules
% 4.69/2.30 ----------------------
% 4.69/2.30 #Ref : 0
% 4.69/2.30 #Sup : 162
% 4.69/2.31 #Fact : 0
% 4.69/2.31 #Define : 2
% 4.69/2.31 #Split : 16
% 4.69/2.31 #Chain : 0
% 4.69/2.31 #Close : 2
% 4.69/2.31
% 4.69/2.31 Ordering : LPO
% 4.69/2.31
% 4.69/2.31 Simplification rules
% 4.69/2.31 ----------------------
% 4.69/2.31 #Subsume : 29
% 4.69/2.31 #Demod : 44
% 4.69/2.31 #Tautology : 38
% 4.69/2.31 #SimpNegUnit : 12
% 4.69/2.31 #BackRed : 0
% 4.69/2.31
% 4.69/2.31 #Partial instantiations: 0
% 4.69/2.31 #Strategies tried : 1
% 4.69/2.31
% 4.69/2.31 Timing (in seconds)
% 4.69/2.31 ----------------------
% 4.69/2.31 Preprocessing : 0.56
% 4.69/2.31 Parsing : 0.30
% 4.69/2.31 CNF conversion : 0.03
% 4.69/2.31 Main loop : 0.61
% 4.69/2.31 Inferencing : 0.10
% 4.69/2.31 Reduction : 0.20
% 4.69/2.31 Demodulation : 0.15
% 4.69/2.31 BG Simplification : 0.09
% 4.69/2.31 Subsumption : 0.11
% 4.69/2.31 Abstraction : 0.03
% 4.69/2.31 MUC search : 0.02
% 4.69/2.31 Cooper : 0.07
% 4.69/2.31 Total : 1.23
% 4.69/2.31 Index Insertion : 0.00
% 4.69/2.31 Index Deletion : 0.00
% 4.69/2.31 Index Matching : 0.00
% 4.69/2.31 BG Taut test : 0.00
%------------------------------------------------------------------------------