TSTP Solution File: ARI592_1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : ARI592_1 : TPTP v8.1.2. Released v5.1.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 : n026.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:04 EDT 2023
% Result : Theorem 2.09s 1.49s
% Output : CNFRefutation 2.09s
% 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 : 15 ( 3 equ)
% Maximal formula atoms : 5 ( 3 avg)
% Number of connectives : 16 ( 6 ~; 4 |; 4 &)
% ( 1 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 7 avg)
% Maximal term depth : 1 ( 1 avg)
% Number arithmetic : 29 ( 9 atm; 0 fun; 6 num; 14 var)
% Number of types : 1 ( 0 usr; 1 ari)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 3 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 2 ( 0 usr; 2 con; 0-0 aty)
% Number of variables : 14 (; 9 !; 5 ?; 14 :)
% Comments :
%------------------------------------------------------------------------------
%$ #nlpp
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(f_38,negated_conjecture,
~ ! [Ya: $int,Za: $int] :
( $less(2,Za)
=> ? [Xa: $int] :
( $less(0,Xa)
& $less(Xa,Za)
& ( Ya != Xa ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',exists_X_0_Z_noteq_Y) ).
tff(f_502,plain,
! [Xa: $int] :
? [Ya: $int,Za: $int] :
( $less(2,Za)
& ! [Xa: $int] :
( ~ $less(0,Xa)
| ~ $less(Xa,Za)
| ( Ya = Xa ) ) ),
inference(cnfTransformation,[status(thm)],[f_38]) ).
tff(f_505,plain,
! [Xa: $int,Ya: $int,Za: $int] :
( ! [Xa: $int] :
? [Ya: $int,Za: $int] :
( $less(2,Za)
& ! [Xa: $int] :
( ~ $less(0,Xa)
| ~ $less(Xa,Za)
| ( Ya = Xa ) ) )
<=> $false ),
inference(theorem,[status(thm),theory('LIA')],]) ).
tff(f_506,plain,
$false,
inference(equivalence,[status(thm)],[f_502,f_505]) ).
tff(c_2,plain,
$false,
inference(cnfTransformation,[status(thm)],[f_506]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : ARI592_1 : TPTP v8.1.2. Released v5.1.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 : n026.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:32 EDT 2023
% 0.13/0.35 % CPUTime :
% 2.09/1.49 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.09/1.49
% 2.09/1.49 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 2.09/1.53
% 2.09/1.53 Inference rules
% 2.09/1.53 ----------------------
% 2.09/1.53 #Ref : 0
% 2.09/1.53 #Sup : 0
% 2.09/1.53 #Fact : 0
% 2.09/1.53 #Define : 0
% 2.09/1.53 #Split : 0
% 2.09/1.53 #Chain : 0
% 2.09/1.53 #Close : 0
% 2.09/1.53
% 2.09/1.53 Ordering : LPO
% 2.09/1.53
% 2.09/1.53 Simplification rules
% 2.09/1.53 ----------------------
% 2.09/1.53 #Subsume : 0
% 2.09/1.53 #Demod : 0
% 2.09/1.53 #Tautology : 0
% 2.09/1.53 #SimpNegUnit : 0
% 2.09/1.53 #BackRed : 0
% 2.09/1.53
% 2.09/1.53 #Partial instantiations: 0
% 2.09/1.53 #Strategies tried : 1
% 2.09/1.53
% 2.09/1.53 Timing (in seconds)
% 2.09/1.53 ----------------------
% 2.09/1.53 Preprocessing : 0.42
% 2.09/1.53 Parsing : 0.23
% 2.09/1.53 CNF conversion : 0.01
% 2.09/1.53 Main loop : 0.03
% 2.09/1.53 Inferencing : 0.00
% 2.09/1.53 Reduction : 0.00
% 2.09/1.53 Demodulation : 0.00
% 2.09/1.53 BG Simplification : 0.00
% 2.09/1.53 Subsumption : 0.02
% 2.09/1.53 Abstraction : 0.00
% 2.09/1.53 MUC search : 0.00
% 2.09/1.53 Cooper : 0.06
% 2.09/1.53 Total : 0.50
% 2.09/1.53 Index Insertion : 0.00
% 2.09/1.53 Index Deletion : 0.00
% 2.09/1.53 Index Matching : 0.00
% 2.09/1.53 BG Taut test : 0.00
%------------------------------------------------------------------------------