TSTP Solution File: ARI091_1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : ARI091_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 : 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 10:33:11 EDT 2023
% Result : Theorem 2.30s 1.48s
% Output : CNFRefutation 2.30s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 2
% Syntax : Number of formulae : 5 ( 2 unt; 0 typ; 0 def)
% Number of atoms : 9 ( 6 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 7 ( 3 ~; 0 |; 2 &)
% ( 1 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number arithmetic : 16 ( 0 atm; 3 fun; 9 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 : 4 ( 0 usr; 3 con; 0-2 aty)
% Number of variables : 4 (; 2 !; 2 ?; 4 :)
% Comments :
%------------------------------------------------------------------------------
%$ #nlpp
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(f_32,negated_conjecture,
~ ! [Xa: $int] :
( ( $difference(Xa,2) = 3 )
=> ( Xa = 5 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',diff_only_5_2_3) ).
tff(f_110,plain,
? [Xa: $int] :
( ( $difference(Xa,2) = 3 )
& ( Xa != 5 ) ),
inference(cnfTransformation,[status(thm)],[f_32]) ).
tff(f_113,plain,
! [Xa: $int] :
( ? [Xa: $int] :
( ( $difference(Xa,2) = 3 )
& ( Xa != 5 ) )
<=> $false ),
inference(theorem,[status(thm),theory('LIA')],]) ).
tff(f_114,plain,
$false,
inference(equivalence,[status(thm)],[f_110,f_113]) ).
tff(c_2,plain,
$false,
inference(cnfTransformation,[status(thm)],[f_114]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : ARI091_1 : TPTP v8.1.2. Released v5.0.0.
% 0.13/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 : n002.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:25:17 EDT 2023
% 0.13/0.35 % CPUTime :
% 2.30/1.48 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.30/1.48
% 2.30/1.48 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 2.30/1.51
% 2.30/1.51 Inference rules
% 2.30/1.51 ----------------------
% 2.30/1.51 #Ref : 0
% 2.30/1.51 #Sup : 0
% 2.30/1.51 #Fact : 0
% 2.30/1.51 #Define : 0
% 2.30/1.51 #Split : 0
% 2.30/1.51 #Chain : 0
% 2.30/1.51 #Close : 0
% 2.30/1.51
% 2.30/1.51 Ordering : LPO
% 2.30/1.51
% 2.30/1.51 Simplification rules
% 2.30/1.51 ----------------------
% 2.30/1.51 #Subsume : 0
% 2.30/1.51 #Demod : 0
% 2.30/1.51 #Tautology : 0
% 2.30/1.51 #SimpNegUnit : 0
% 2.30/1.51 #BackRed : 0
% 2.30/1.51
% 2.30/1.51 #Partial instantiations: 0
% 2.30/1.51 #Strategies tried : 1
% 2.30/1.51
% 2.30/1.51 Timing (in seconds)
% 2.30/1.51 ----------------------
% 2.30/1.52 Preprocessing : 0.41
% 2.30/1.52 Parsing : 0.23
% 2.30/1.52 CNF conversion : 0.02
% 2.30/1.52 Main loop : 0.03
% 2.30/1.52 Inferencing : 0.00
% 2.30/1.52 Reduction : 0.00
% 2.30/1.52 Demodulation : 0.00
% 2.30/1.52 BG Simplification : 0.00
% 2.30/1.52 Subsumption : 0.02
% 2.30/1.52 Abstraction : 0.00
% 2.30/1.52 MUC search : 0.00
% 2.30/1.52 Cooper : 0.02
% 2.30/1.52 Total : 0.49
% 2.30/1.52 Index Insertion : 0.00
% 2.30/1.52 Index Deletion : 0.00
% 2.30/1.52 Index Matching : 0.00
% 2.30/1.52 BG Taut test : 0.00
%------------------------------------------------------------------------------