TSTP Solution File: ARI614_1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : ARI614_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/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 : n020.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 3.08s 1.81s
% Output : CNFRefutation 3.08s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 4
% Syntax : Number of formulae : 12 ( 1 unt; 3 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 : 35 ( 9 atm; 6 fun; 8 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 : 4 ( 1 usr; 2 con; 0-2 aty)
% Number of variables : 12 (; 10 !; 2 ?; 12 :)
% Comments :
%------------------------------------------------------------------------------
%$ q > p > #nlpp
%Foreground sorts:
%Background operators:
tff(a,type,
a: $int ).
%Foreground operators:
tff(q,type,
q: $int > $o ).
tff(p,type,
p: $int > $o ).
tff(f_44,negated_conjecture,
~ ( ( ! [Xa: $int] :
( $less(a,Xa)
=> p(Xa) )
& ! [Xa: $int] :
( $less(Xa,0)
=> q(Xa) ) )
=> ? [Xa: $int,Ya: $int] :
( p(Xa)
& q(Ya)
& ( $sum(Xa,Ya) = 0 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',interv_a_infty_and_neginfty_1_contain_compl) ).
tff(c_6,plain,
! [X_1a: $int] :
( p(X_1a)
| ~ $less(a,X_1a) ),
inference(cnfTransformation,[status(thm)],[f_44]) ).
tff(c_7,plain,
! [X_2a: $int] :
( q(X_2a)
| ~ $less(X_2a,0) ),
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,0) ),
inference(resolution,[status(thm)],[c_7,c_16]) ).
tff(c_29,plain,
! [X_13a: $int] :
( ~ $less(X_13a,0)
| ~ $less(a,$uminus(X_13a)) ),
inference(resolution,[status(thm)],[c_6,c_25]) ).
tff(c_31,plain,
! [X_13a: $int] :
( ~ $less(X_13a,0)
| ~ $less($sum(X_13a,a),0) ),
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.14 % Problem : ARI614_1 : TPTP v8.1.2. Released v5.1.0.
% 0.15/0.15 % 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.16/0.36 % Computer : n020.cluster.edu
% 0.16/0.36 % Model : x86_64 x86_64
% 0.16/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.36 % Memory : 8042.1875MB
% 0.16/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.36 % CPULimit : 300
% 0.16/0.36 % WCLimit : 300
% 0.16/0.36 % DateTime : Fri Aug 4 00:07:22 EDT 2023
% 0.16/0.36 % CPUTime :
% 3.08/1.81 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.08/1.82
% 3.08/1.82 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 3.08/1.84
% 3.08/1.84 Inference rules
% 3.08/1.84 ----------------------
% 3.08/1.84 #Ref : 0
% 3.08/1.84 #Sup : 2
% 3.08/1.84 #Fact : 0
% 3.08/1.84 #Define : 0
% 3.08/1.84 #Split : 0
% 3.08/1.84 #Chain : 0
% 3.08/1.84 #Close : 0
% 3.08/1.84
% 3.08/1.84 Ordering : LPO
% 3.08/1.84
% 3.08/1.84 Simplification rules
% 3.08/1.84 ----------------------
% 3.08/1.84 #Subsume : 0
% 3.08/1.84 #Demod : 0
% 3.08/1.84 #Tautology : 0
% 3.08/1.84 #SimpNegUnit : 0
% 3.08/1.84 #BackRed : 0
% 3.08/1.84
% 3.08/1.84 #Partial instantiations: 0
% 3.08/1.84 #Strategies tried : 1
% 3.08/1.84
% 3.08/1.84 Timing (in seconds)
% 3.08/1.84 ----------------------
% 3.08/1.84 Preprocessing : 0.52
% 3.08/1.84 Parsing : 0.29
% 3.08/1.84 CNF conversion : 0.03
% 3.08/1.84 Main loop : 0.14
% 3.08/1.85 Inferencing : 0.06
% 3.08/1.85 Reduction : 0.01
% 3.08/1.85 Demodulation : 0.01
% 3.08/1.85 BG Simplification : 0.03
% 3.08/1.85 Subsumption : 0.03
% 3.08/1.85 Abstraction : 0.00
% 3.08/1.85 MUC search : 0.00
% 3.08/1.85 Cooper : 0.02
% 3.08/1.85 Total : 0.71
% 3.08/1.85 Index Insertion : 0.00
% 3.08/1.85 Index Deletion : 0.00
% 3.08/1.85 Index Matching : 0.00
% 3.08/1.85 BG Taut test : 0.00
%------------------------------------------------------------------------------