TSTP Solution File: ARI613_1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : ARI613_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 : 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:34:07 EDT 2023
% Result : Theorem 2.82s 1.71s
% Output : CNFRefutation 2.82s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 3
% Syntax : Number of formulae : 11 ( 1 unt; 2 typ; 0 def)
% Number of atoms : 23 ( 2 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 28 ( 14 ~; 8 |; 3 &)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number arithmetic : 38 ( 9 atm; 6 fun; 11 num; 12 var)
% Number of types : 2 ( 0 usr; 1 ari)
% Number of type conns : 2 ( 2 >; 0 *; 0 +; 0 <<)
% Number of predicates : 5 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 0 usr; 3 con; 0-2 aty)
% Number of variables : 12 (; 10 !; 2 ?; 12 :)
% Comments :
%------------------------------------------------------------------------------
%$ q > p > #nlpp
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(q,type,
q: $int > $o ).
tff(p,type,
p: $int > $o ).
tff(f_44,negated_conjecture,
~ ( ( ! [Xa: $int] :
( $less(3,Xa)
=> p(Xa) )
& ! [Xa: $int] :
( $less(Xa,1)
=> q(Xa) ) )
=> ? [Xa: $int,Ya: $int] :
( p(Xa)
& q(Ya)
& ( $sum(Xa,Ya) = 0 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',interv_3_infty_and_neginfty_1_contain_compl) ).
tff(c_6,plain,
! [X_1a: $int] :
( p(X_1a)
| ~ $less(3,X_1a) ),
inference(cnfTransformation,[status(thm)],[f_44]) ).
tff(c_7,plain,
! [X_2a: $int] :
( q(X_2a)
| ~ $less(X_2a,1) ),
inference(cnfTransformation,[status(thm)],[f_44]) ).
tff(c_1,plain,
! [Y_4a: $int,X_3a: $int] :
( ~ q(Y_4a)
| ~ p(X_3a)
| ( $sum(X_3a,Y_4a) != 0 ) ),
inference(cnfTransformation,[status(thm)],[f_44]) ).
tff(c_16,plain,
! [Y_9a: $int] :
( ~ q(Y_9a)
| ~ p($uminus(Y_9a)) ),
inference(backgroundSimplification,[status(thm),theory('LRFIA')],[c_1]) ).
tff(c_25,plain,
! [X_13a: $int] :
( ~ p($uminus(X_13a))
| ~ $less(X_13a,1) ),
inference(resolution,[status(thm)],[c_7,c_16]) ).
tff(c_29,plain,
! [X_13a: $int] :
( ~ $less(X_13a,1)
| ~ $less(3,$uminus(X_13a)) ),
inference(resolution,[status(thm)],[c_6,c_25]) ).
tff(c_31,plain,
! [X_13a: $int] :
( ~ $less(X_13a,1)
| ~ $less(X_13a,$uminus(3)) ),
inference(backgroundSimplification,[status(thm),theory('LIA')],[c_29]) ).
tff(c_33,plain,
$false,
inference(quantifierElimination,[status(thm),theory('LIA')],[c_31]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : ARI613_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.15/0.36 % Computer : n002.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % 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 : Fri Aug 4 00:23:01 EDT 2023
% 0.15/0.36 % CPUTime :
% 2.82/1.71 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.82/1.72
% 2.82/1.72 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 2.82/1.74
% 2.82/1.74 Inference rules
% 2.82/1.74 ----------------------
% 2.82/1.74 #Ref : 0
% 2.82/1.74 #Sup : 2
% 2.82/1.74 #Fact : 0
% 2.82/1.74 #Define : 0
% 2.82/1.74 #Split : 0
% 2.82/1.74 #Chain : 0
% 2.82/1.74 #Close : 0
% 2.82/1.74
% 2.82/1.74 Ordering : LPO
% 2.82/1.74
% 2.82/1.74 Simplification rules
% 2.82/1.74 ----------------------
% 2.82/1.74 #Subsume : 0
% 2.82/1.74 #Demod : 0
% 2.82/1.74 #Tautology : 0
% 2.82/1.74 #SimpNegUnit : 0
% 2.82/1.74 #BackRed : 0
% 2.82/1.74
% 2.82/1.74 #Partial instantiations: 0
% 2.82/1.74 #Strategies tried : 1
% 2.82/1.74
% 2.82/1.74 Timing (in seconds)
% 2.82/1.74 ----------------------
% 2.82/1.74 Preprocessing : 0.49
% 2.82/1.74 Parsing : 0.27
% 2.82/1.74 CNF conversion : 0.02
% 2.82/1.74 Main loop : 0.13
% 2.82/1.74 Inferencing : 0.06
% 2.82/1.74 Reduction : 0.01
% 2.82/1.74 Demodulation : 0.01
% 2.82/1.74 BG Simplification : 0.03
% 2.90/1.74 Subsumption : 0.02
% 2.90/1.74 Abstraction : 0.00
% 2.90/1.74 MUC search : 0.00
% 2.90/1.74 Cooper : 0.01
% 2.90/1.75 Total : 0.66
% 2.90/1.75 Index Insertion : 0.00
% 2.90/1.75 Index Deletion : 0.00
% 2.90/1.75 Index Matching : 0.00
% 2.90/1.75 BG Taut test : 0.00
%------------------------------------------------------------------------------