TSTP Solution File: ARI702_1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : ARI702_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 : n007.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 3.71s 2.02s
% Output : CNFRefutation 3.71s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 12
% Syntax : Number of formulae : 33 ( 24 unt; 8 typ; 0 def)
% Number of atoms : 27 ( 25 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 12 ( 10 ~; 2 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number arithmetic : 53 ( 0 atm; 31 fun; 18 num; 4 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 ( 8 usr; 10 con; 0-2 aty)
% Number of variables : 4 (; 4 !; 0 ?; 4 :)
% Comments :
%------------------------------------------------------------------------------
%$ #nlpp
%Foreground sorts:
%Background operators:
tff(y,type,
y: $int ).
tff('#skE_2',type,
'#skE_2': $int ).
tff('#skE_1',type,
'#skE_1': $int ).
tff(z,type,
z: $int ).
tff('#skE_3',type,
'#skE_3': $int ).
tff(b,type,
b: $int ).
tff(a,type,
a: $int ).
tff(x,type,
x: $int ).
%Foreground operators:
tff(f_72,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_34,negated_conjecture,
$product($product(x,y),z) != 1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj) ).
tff(f_30,axiom,
$product($product(2,x),y) = a,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',eq1) ).
tff(f_32,axiom,
$product(a,z) = 2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',eq3) ).
tff(c_59,plain,
! [B_7: $int,A_8: $int] : ( $product(B_7,A_8) = $product(A_8,B_7) ),
inference(cnfTransformation,[status(thm)],[f_72]) ).
tff(c_37,plain,
$product($product(x,y),z) != 1,
inference(cnfTransformation,[status(thm)],[f_34]) ).
tff(c_234,plain,
$product(z,$product(x,y)) != 1,
inference(demodulation,[status(thm),theory(equality)],[c_59,c_37]) ).
tff(c_236,plain,
$product(x,y) = '#skE_2',
inference(define,[status(thm),theory(equality)],[c_234]) ).
tff(c_235,plain,
$product(z,$product(x,y)) != 1,
inference(demodulation,[status(thm),theory(equality)],[c_59,c_37]) ).
tff(c_239,plain,
$product(z,'#skE_2') != 1,
inference(demodulation,[status(thm),theory(equality)],[c_236,c_235]) ).
tff(c_249,plain,
$product('#skE_2',z) != 1,
inference(demodulation,[status(thm),theory(equality)],[c_59,c_239]) ).
tff(c_580,plain,
$product('#skE_2',z) = '#skE_3',
inference(define,[status(thm),theory(equality)],[c_249]) ).
tff(c_579,plain,
$product('#skE_2',z) != 1,
inference(demodulation,[status(thm),theory(equality)],[c_59,c_239]) ).
tff(c_587,plain,
'#skE_3' != 1,
inference(demodulation,[status(thm),theory(equality)],[c_580,c_579]) ).
tff(c_409,plain,
$product(x,y) = '#skE_2',
inference(define,[status(thm),theory(equality)],[c_234]) ).
tff(c_2,plain,
$product($product(2,x),y) = a,
inference(cnfTransformation,[status(thm)],[f_30]) ).
tff(c_49,plain,
$product(2,$product(x,y)) = a,
inference(backgroundSimplification,[status(thm),theory('LRFIA')],[c_2]) ).
tff(c_787,plain,
a = $product(2,'#skE_2'),
inference(demodulation,[status(thm),theory(equality)],[c_409,c_49]) ).
tff(c_41,plain,
$product(a,z) = 2,
inference(cnfTransformation,[status(thm)],[f_32]) ).
tff(c_803,plain,
$product($product(2,'#skE_2'),z) = 2,
inference(demodulation,[status(thm),theory(equality)],[c_787,c_41]) ).
tff(c_819,plain,
$product('#skE_2',z) = 1,
inference(backgroundSimplification,[status(thm),theory('LIA')],[c_803]) ).
tff(c_586,plain,
$product('#skE_2',z) = '#skE_3',
inference(define,[status(thm),theory(equality)],[c_249]) ).
tff(c_825,plain,
( ( '#skE_3' = 1 )
| ( z != z )
| ( '#skE_2' != '#skE_2' ) ),
inference(superposition,[status(thm),theory(equality)],[c_819,c_586]) ).
tff(c_913,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_587,c_825]) ).
tff(c_916,plain,
$false,
inference(backgroundSimplification,[status(thm),theory('LIA')],[c_913]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : ARI702_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/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.15/0.35 % Computer : n007.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Thu Aug 3 23:58:24 EDT 2023
% 0.15/0.36 % CPUTime :
% 3.71/2.02 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.71/2.02
% 3.71/2.02 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 3.71/2.05
% 3.71/2.05 Inference rules
% 3.71/2.05 ----------------------
% 3.71/2.05 #Ref : 0
% 3.71/2.05 #Sup : 128
% 3.71/2.05 #Fact : 0
% 3.71/2.05 #Define : 3
% 3.71/2.05 #Split : 13
% 3.71/2.05 #Chain : 0
% 3.71/2.05 #Close : 0
% 3.71/2.05
% 3.71/2.05 Ordering : LPO
% 3.71/2.05
% 3.71/2.05 Simplification rules
% 3.71/2.05 ----------------------
% 3.71/2.05 #Subsume : 19
% 3.71/2.05 #Demod : 12
% 3.71/2.05 #Tautology : 10
% 3.71/2.05 #SimpNegUnit : 5
% 3.71/2.05 #BackRed : 6
% 3.71/2.05
% 3.71/2.05 #Partial instantiations: 0
% 3.71/2.05 #Strategies tried : 1
% 3.71/2.05
% 3.71/2.05 Timing (in seconds)
% 3.71/2.05 ----------------------
% 3.71/2.06 Preprocessing : 0.55
% 3.71/2.06 Parsing : 0.30
% 3.71/2.06 CNF conversion : 0.02
% 3.71/2.06 Main loop : 0.43
% 3.71/2.06 Inferencing : 0.09
% 3.71/2.06 Reduction : 0.13
% 3.71/2.06 Demodulation : 0.10
% 3.71/2.06 BG Simplification : 0.07
% 3.71/2.06 Subsumption : 0.09
% 3.71/2.06 Abstraction : 0.03
% 3.71/2.06 MUC search : 0.00
% 3.71/2.06 Cooper : 0.04
% 3.71/2.06 Total : 1.03
% 3.71/2.06 Index Insertion : 0.00
% 3.71/2.06 Index Deletion : 0.00
% 3.71/2.06 Index Matching : 0.00
% 3.71/2.06 BG Taut test : 0.00
%------------------------------------------------------------------------------