TSTP Solution File: ARI118_1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : ARI118_1 : TPTP v8.1.2. Released v5.0.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 : 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:33:15 EDT 2023
% Result : Theorem 2.74s 1.68s
% Output : CNFRefutation 2.74s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 2
% Syntax : Number of formulae : 5 ( 4 unt; 0 typ; 0 def)
% Number of atoms : 7 ( 6 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 4 ( 2 ~; 1 |; 0 &)
% ( 1 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number arithmetic : 14 ( 0 atm; 4 fun; 3 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 : 3 ( 0 usr; 2 con; 0-2 aty)
% Number of variables : 7 (; 5 !; 2 ?; 7 :)
% Comments :
%------------------------------------------------------------------------------
%$ #nlpp
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(f_87,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_30,negated_conjecture,
~ ? [Xa: $int,Ya: $int] : ( $product(Xa,Ya) = Xa ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',product_something_anotherthing_firstthing) ).
tff(c_29,plain,
! [C_25: $int] : ( $product(C_25,1) = C_25 ),
inference(cnfTransformation,[status(thm)],[f_87]) ).
tff(c_42,plain,
! [X_34a: $int,Y_35a: $int] : ( $product(X_34a,Y_35a) != X_34a ),
inference(cnfTransformation,[status(thm)],[f_30]) ).
tff(c_76,plain,
$false,
inference(superposition,[status(thm),theory(equality)],[c_29,c_42]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : ARI118_1 : TPTP v8.1.2. Released v5.0.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.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:07:52 EDT 2023
% 0.13/0.35 % CPUTime :
% 2.74/1.68 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.74/1.68
% 2.74/1.68 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 2.74/1.71
% 2.74/1.71 Inference rules
% 2.74/1.71 ----------------------
% 2.74/1.71 #Ref : 0
% 2.74/1.71 #Sup : 7
% 2.74/1.71 #Fact : 0
% 2.74/1.71 #Define : 0
% 2.74/1.71 #Split : 0
% 2.74/1.71 #Chain : 0
% 2.74/1.71 #Close : 0
% 2.74/1.71
% 2.74/1.71 Ordering : LPO
% 2.74/1.71
% 2.74/1.71 Simplification rules
% 2.74/1.71 ----------------------
% 2.74/1.71 #Subsume : 1
% 2.74/1.71 #Demod : 1
% 2.74/1.71 #Tautology : 0
% 2.74/1.71 #SimpNegUnit : 0
% 2.74/1.71 #BackRed : 0
% 2.74/1.71
% 2.74/1.71 #Partial instantiations: 0
% 2.74/1.71 #Strategies tried : 1
% 2.74/1.71
% 2.74/1.71 Timing (in seconds)
% 2.74/1.71 ----------------------
% 2.95/1.72 Preprocessing : 0.51
% 2.95/1.72 Parsing : 0.28
% 2.95/1.72 CNF conversion : 0.03
% 2.95/1.72 Main loop : 0.09
% 2.95/1.72 Inferencing : 0.03
% 2.95/1.72 Reduction : 0.03
% 2.95/1.72 Demodulation : 0.02
% 2.95/1.72 BG Simplification : 0.04
% 2.95/1.72 Subsumption : 0.03
% 2.95/1.72 Abstraction : 0.01
% 2.95/1.72 MUC search : 0.00
% 2.95/1.72 Cooper : 0.00
% 2.95/1.72 Total : 0.65
% 2.95/1.72 Index Insertion : 0.00
% 2.95/1.72 Index Deletion : 0.00
% 2.95/1.72 Index Matching : 0.00
% 2.95/1.72 BG Taut test : 0.00
%------------------------------------------------------------------------------