TSTP Solution File: ARI706_1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : ARI706_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:16 EDT 2023
% Result : Theorem 2.41s 1.61s
% Output : CNFRefutation 2.85s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 3
% Syntax : Number of formulae : 8 ( 7 unt; 1 typ; 0 def)
% Number of atoms : 7 ( 6 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 3 ( 3 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 2 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number arithmetic : 20 ( 0 atm; 14 fun; 6 num; 0 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 : 5 ( 1 usr; 4 con; 0-2 aty)
% Number of variables : 0 (; 0 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ #nlpp
%Foreground sorts:
%Background operators:
tff(d,type,
d: $int ).
%Foreground operators:
tff(f_30,axiom,
$product(d,d) = $product($product(2,d),d),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',eq) ).
tff(f_32,negated_conjecture,
$product(d,d) != $product($product(d,3),d),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj) ).
tff(c_2,plain,
$product($product(2,d),d) = $product(d,d),
inference(cnfTransformation,[status(thm)],[f_30]) ).
tff(c_51,plain,
$product(d,d) = 0,
inference(backgroundSimplification,[status(thm),theory('LRFIA')],[c_2]) ).
tff(c_5,plain,
$product($product(3,d),d) != $product(d,d),
inference(cnfTransformation,[status(thm)],[f_32]) ).
tff(c_33,plain,
$product(d,d) != 0,
inference(backgroundSimplification,[status(thm),theory('LRFIA')],[c_5]) ).
tff(c_55,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_51,c_33]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : ARI706_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.13/0.35 % Computer : n012.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:05:07 EDT 2023
% 0.13/0.35 % CPUTime :
% 2.41/1.61 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.79/1.62
% 2.79/1.62 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 2.85/1.65
% 2.85/1.65 Inference rules
% 2.85/1.65 ----------------------
% 2.85/1.65 #Ref : 0
% 2.85/1.65 #Sup : 0
% 2.85/1.65 #Fact : 0
% 2.85/1.65 #Define : 0
% 2.85/1.65 #Split : 0
% 2.85/1.65 #Chain : 0
% 2.85/1.65 #Close : 0
% 2.85/1.65
% 2.85/1.65 Ordering : LPO
% 2.85/1.65
% 2.85/1.65 Simplification rules
% 2.85/1.65 ----------------------
% 2.85/1.65 #Subsume : 1
% 2.85/1.65 #Demod : 1
% 2.85/1.65 #Tautology : 0
% 2.85/1.65 #SimpNegUnit : 0
% 2.85/1.65 #BackRed : 0
% 2.85/1.65
% 2.85/1.65 #Partial instantiations: 0
% 2.85/1.65 #Strategies tried : 1
% 2.85/1.65
% 2.85/1.65 Timing (in seconds)
% 2.85/1.65 ----------------------
% 2.85/1.65 Preprocessing : 0.55
% 2.85/1.65 Parsing : 0.30
% 2.85/1.65 CNF conversion : 0.03
% 2.85/1.65 Main loop : 0.05
% 2.85/1.65 Inferencing : 0.00
% 2.85/1.65 Reduction : 0.02
% 2.85/1.65 Demodulation : 0.01
% 2.85/1.65 BG Simplification : 0.04
% 2.85/1.65 Subsumption : 0.03
% 2.85/1.65 Abstraction : 0.01
% 2.85/1.65 MUC search : 0.00
% 2.85/1.65 Cooper : 0.00
% 2.85/1.65 Total : 0.66
% 2.85/1.65 Index Insertion : 0.00
% 2.85/1.65 Index Deletion : 0.00
% 2.85/1.66 Index Matching : 0.00
% 2.85/1.66 BG Taut test : 0.00
%------------------------------------------------------------------------------