%------------------------------------------------------------------------------
% File : Beagle---0.9.52
% Problem : ARI602_1 : TPTP v9.0.0. 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 : n027.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 : Wed Apr 9 05:40:40 PM UTC 2025
% Result : Theorem 2.97s 1.80s
% Output : CNFRefutation 3.02s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 1
% Syntax : Number of formulae : 11 ( 8 unt; 0 typ; 0 def)
% Number of atoms : 15 ( 2 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 10 ( 6 ~; 2 |; 1 &)
% ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number arithmetic : 28 ( 12 atm; 0 fun; 10 num; 6 var)
% Number of types : 1 ( 0 usr; 1 ari)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 5 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 2 usr; 3 con; 0-1 aty)
% Number of variables : 6 ( 5 !; 1 ?; 6 :)
% Comments :
%------------------------------------------------------------------------------
%$ #nlpp > f
%Foreground sorts:
%Background operators:
tff('#skE_1',type,
'#skE_1': $int ).
%Foreground operators:
tff(f,type,
f: $int > $int ).
tff(f_35,negated_conjecture,
~ ( ! [Xa: $int] : $greater(f(Xa),Xa)
=> ? [Ya: $int] :
( $less(4,Ya)
& $less(Ya,f(5)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fX_gt_X_implies_exist_ineq) ).
tff(c_6,plain,
! [Y_2a: $int] :
( ~ $less(Y_2a,f(5))
| ~ $less(4,Y_2a) ),
inference(cnfTransformation,[status(thm)],[f_35]) ).
tff(c_8,plain,
f(5) = '#skE_1',
inference(define,[status(thm),theory(equality)],[c_6]) ).
tff(c_12,plain,
! [Y_2a: $int] :
( ~ $less(Y_2a,'#skE_1')
| ~ $less(4,Y_2a) ),
inference(demodulation,[status(thm),theory(equality)],[c_8,c_6]) ).
tff(c_23,plain,
$lesseq('#skE_1',5),
inference(quantifierElimination,[status(thm),theory('LIA')],[c_12]) ).
tff(c_25,plain,
~ $less(5,'#skE_1'),
inference(backgroundSimplification,[status(thm),theory('LIA')],[c_23]) ).
tff(c_11,plain,
f(5) = '#skE_1',
inference(define,[status(thm),theory(equality)],[c_6]) ).
tff(c_3,plain,
! [X_1a: $int] : $greater(f(X_1a),X_1a),
inference(cnfTransformation,[status(thm)],[f_35]) ).
tff(c_5,plain,
! [X_1a: $int] : $less(X_1a,f(X_1a)),
inference(backgroundSimplification,[status(thm),theory('LRFIA')],[c_3]) ).
tff(c_20,plain,
$less(5,'#skE_1'),
inference(superposition,[status(thm),theory(equality)],[c_11,c_5]) ).
tff(c_26,plain,
$false,
inference(close,[status(thm),theory('LIA')],[c_25,c_20]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : ARI602_1 : TPTP v9.0.0. Released v5.1.0.
% 0.10/0.12 % 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.12/0.33 % Computer : n027.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Mon Apr 7 15:14:36 EDT 2025
% 0.12/0.33 % CPUTime :
% 2.97/1.80 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.97/1.80
% 2.97/1.80 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------