TSTP Solution File: SWW632_2 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SWW632_2 : TPTP v8.1.2. Released v6.1.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 11:07:51 EDT 2023
% Result : Theorem 4.62s 2.27s
% Output : CNFRefutation 5.03s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 32
% Syntax : Number of formulae : 52 ( 19 unt; 29 typ; 0 def)
% Number of atoms : 31 ( 24 equ)
% Maximal formula atoms : 5 ( 1 avg)
% Number of connectives : 19 ( 11 ~; 3 |; 1 &)
% ( 1 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number arithmetic : 40 ( 6 atm; 6 fun; 18 num; 10 var)
% Number of types : 6 ( 4 usr; 1 ari)
% Number of type conns : 19 ( 10 >; 9 *; 0 +; 0 <<)
% Number of predicates : 5 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 27 ( 24 usr; 17 con; 0-4 aty)
% Number of variables : 10 (; 10 !; 0 ?; 10 :)
% Comments :
%------------------------------------------------------------------------------
%$ sort > match_bool > power > mod > mk_ref > div > contents > #nlpp > witness > ref > abs > tuple02 > tuple01 > true > real > qtmark > int > false > bool1
%Foreground sorts:
tff(bool,type,
bool: $tType ).
tff(tuple0,type,
tuple0: $tType ).
tff(ty,type,
ty: $tType ).
tff(uni,type,
uni: $tType ).
%Background operators:
tff('#skE_2',type,
'#skE_2': $int ).
tff('#skE_1',type,
'#skE_1': $int ).
tff('#skF_5',type,
'#skF_5': $int ).
tff('#skF_4',type,
'#skF_4': $int ).
tff('#skF_2',type,
'#skF_2': $int ).
tff('#skF_3',type,
'#skF_3': $int ).
tff('#skF_1',type,
'#skF_1': $int ).
%Foreground operators:
tff(tuple02,type,
tuple02: tuple0 ).
tff(div,type,
div: ( $int * $int ) > $int ).
tff(tuple01,type,
tuple01: ty ).
tff(int,type,
int: ty ).
tff(abs,type,
abs: $int > $int ).
tff(contents,type,
contents: ( ty * uni ) > uni ).
tff(real,type,
real: ty ).
tff(match_bool,type,
match_bool: ( ty * bool * uni * uni ) > uni ).
tff(power,type,
power: ( $int * $int ) > $int ).
tff(false,type,
false: bool ).
tff(mod,type,
mod: ( $int * $int ) > $int ).
tff(qtmark,type,
qtmark: ty ).
tff(bool1,type,
bool1: ty ).
tff(sort,type,
sort: ( ty * uni ) > $o ).
tff(true,type,
true: bool ).
tff(ref,type,
ref: ty > ty ).
tff(witness,type,
witness: ty > uni ).
tff(mk_ref,type,
mk_ref: ( ty * uni ) > uni ).
tff(f_207,negated_conjecture,
~ ! [Xa: $int,Na: $int] :
( $lesseq(0,Na)
=> ! [Ea: $int,Pa: $int,Ra: $int] :
( ( $lesseq(0,Ea)
& ( $product(Ra,power(Pa,Ea)) = power(Xa,Na) ) )
=> ( ~ $less(0,Ea)
=> ( Ra = power(Xa,Na) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',wP_parameter_fast_exp_imperative) ).
tff(f_2113,axiom,
! [C: $int,B: $int] :
( ( $product(C,B) = C )
<=> ( ( C = 0 )
| ( B = 1 ) ) ),
file('/export/starexec/sandbox/solver/bin/lemmas/mult_lemmas.p',mult_cancel_right1) ).
tff(f_56,axiom,
! [Xa: $int] : ( power(Xa,0) = 1 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',power_0) ).
tff(c_124,plain,
power('#skF_1','#skF_2') != '#skF_5',
inference(cnfTransformation,[status(thm)],[f_207]) ).
tff(c_224,plain,
power('#skF_1','#skF_2') = '#skE_1',
inference(define,[status(thm),theory(equality)],[c_124]) ).
tff(c_179,plain,
power('#skF_1','#skF_2') != '#skF_5',
inference(cnfTransformation,[status(thm)],[f_207]) ).
tff(c_231,plain,
'#skF_5' != '#skE_1',
inference(demodulation,[status(thm),theory(equality)],[c_224,c_179]) ).
tff(c_119,plain,
$product('#skF_5',power('#skF_4','#skF_3')) = power('#skF_1','#skF_2'),
inference(cnfTransformation,[status(thm)],[f_207]) ).
tff(c_301,plain,
power('#skF_1','#skF_2') = '#skE_1',
inference(define,[status(thm),theory(equality)],[c_119]) ).
tff(c_300,plain,
power('#skF_4','#skF_3') = '#skE_2',
inference(define,[status(thm),theory(equality)],[c_119]) ).
tff(c_178,plain,
$product('#skF_5',power('#skF_4','#skF_3')) = power('#skF_1','#skF_2'),
inference(cnfTransformation,[status(thm)],[f_207]) ).
tff(c_372,plain,
$product('#skF_5','#skE_2') = '#skE_1',
inference(demodulation,[status(thm),theory(equality)],[c_301,c_300,c_178]) ).
tff(c_168,plain,
! [C_97: $int] : ( $product(C_97,1) = C_97 ),
inference(cnfTransformation,[status(thm)],[f_2113]) ).
tff(c_491,plain,
( ( '#skF_5' = '#skE_1' )
| ( '#skE_2' != 1 ) ),
inference(superposition,[status(thm),theory(equality)],[c_372,c_168]) ).
tff(c_527,plain,
'#skE_2' != 1,
inference(negUnitSimplification,[status(thm)],[c_231,c_491]) ).
tff(c_533,plain,
power('#skF_4','#skF_3') = '#skE_2',
inference(define,[status(thm),theory(equality)],[c_119]) ).
tff(c_164,plain,
! [X_17a: $int] : ( power(X_17a,0) = 1 ),
inference(cnfTransformation,[status(thm)],[f_56]) ).
tff(c_543,plain,
( ( '#skE_2' = 1 )
| ( '#skF_3' != 0 ) ),
inference(superposition,[status(thm),theory(equality)],[c_533,c_164]) ).
tff(c_568,plain,
'#skF_3' != 0,
inference(negUnitSimplification,[status(thm)],[c_527,c_543]) ).
tff(c_120,plain,
~ $less(0,'#skF_3'),
inference(cnfTransformation,[status(thm)],[f_207]) ).
tff(c_87,plain,
$lesseq(0,'#skF_3'),
inference(cnfTransformation,[status(thm)],[f_207]) ).
tff(c_115,plain,
~ $less('#skF_3',0),
inference(backgroundSimplification,[status(thm),theory('LRFIA')],[c_87]) ).
tff(c_582,plain,
$false,
inference(close,[status(thm),theory('LIA')],[c_568,c_120,c_115]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.14 % Problem : SWW632_2 : TPTP v8.1.2. Released v6.1.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.16/0.36 % Computer : n002.cluster.edu
% 0.16/0.36 % Model : x86_64 x86_64
% 0.16/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.36 % Memory : 8042.1875MB
% 0.16/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.36 % CPULimit : 300
% 0.16/0.36 % WCLimit : 300
% 0.16/0.36 % DateTime : Thu Aug 3 19:42:16 EDT 2023
% 0.16/0.36 % CPUTime :
% 4.62/2.27 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 4.62/2.27
% 4.62/2.27 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 5.03/2.34
% 5.03/2.34 Inference rules
% 5.03/2.34 ----------------------
% 5.03/2.34 #Ref : 0
% 5.03/2.34 #Sup : 57
% 5.03/2.34 #Fact : 1
% 5.03/2.34 #Define : 3
% 5.03/2.34 #Split : 3
% 5.03/2.34 #Chain : 0
% 5.03/2.34 #Close : 1
% 5.03/2.34
% 5.03/2.34 Ordering : LPO
% 5.03/2.34
% 5.03/2.34 Simplification rules
% 5.03/2.34 ----------------------
% 5.03/2.34 #Subsume : 5
% 5.03/2.34 #Demod : 6
% 5.03/2.34 #Tautology : 27
% 5.03/2.34 #SimpNegUnit : 4
% 5.03/2.34 #BackRed : 0
% 5.03/2.34
% 5.03/2.34 #Partial instantiations: 31
% 5.03/2.34 #Strategies tried : 1
% 5.03/2.34
% 5.03/2.34 Timing (in seconds)
% 5.03/2.34 ----------------------
% 5.42/2.35 Preprocessing : 0.77
% 5.42/2.35 Parsing : 0.40
% 5.42/2.35 CNF conversion : 0.05
% 5.42/2.35 Main loop : 0.40
% 5.42/2.35 Inferencing : 0.10
% 5.42/2.35 Reduction : 0.11
% 5.42/2.35 Demodulation : 0.08
% 5.42/2.35 BG Simplification : 0.08
% 5.42/2.35 Subsumption : 0.07
% 5.42/2.35 Abstraction : 0.01
% 5.42/2.35 MUC search : 0.01
% 5.42/2.35 Cooper : 0.04
% 5.42/2.35 Total : 1.25
% 5.42/2.35 Index Insertion : 0.00
% 5.42/2.35 Index Deletion : 0.00
% 5.42/2.35 Index Matching : 0.00
% 5.42/2.35 BG Taut test : 0.00
%------------------------------------------------------------------------------