%------------------------------------------------------------------------------
% File : Beagle---0.9.52
% Problem : ARI183_1 : TPTP v9.0.0. 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 : n023.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:39:47 PM UTC 2025
% Result : Theorem 2.95s 1.72s
% Output : CNFRefutation 2.97s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 1
% Syntax : Number of formulae : 17 ( 13 unt; 0 typ; 0 def)
% Number of atoms : 22 ( 5 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 15 ( 10 ~; 3 |; 0 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 2 avg)
% Maximal term depth : 4 ( 2 avg)
% Number arithmetic : 40 ( 16 atm; 9 fun; 9 num; 6 var)
% Number of types : 1 ( 0 usr; 1 ari)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 4 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 5 usr; 5 con; 0-2 aty)
% Number of variables : 6 ( 6 !; 0 ?; 6 :)
% Comments :
%------------------------------------------------------------------------------
%$ #nlpp > f
%Foreground sorts:
%Background operators:
tff('#skE_2',type,
'#skE_2': $int ).
tff('#skE_1',type,
'#skE_1': $int ).
tff('#skE_3',type,
'#skE_3': $int ).
tff('#skF_1',type,
'#skF_1': $int ).
%Foreground operators:
tff(f,type,
f: $int > $int ).
tff(f_36,negated_conjecture,
~ ( ! [Ua: $int,Va: $int] :
( $less(Ua,Va)
=> $less(f(Ua),f(Va)) )
=> ! [Wa: $int] : $greater(f($sum(f(Wa),2)),f(f(Wa))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
tff(c_2,plain,
~ $greater(f($sum(2,f('#skF_1'))),f(f('#skF_1'))),
inference(cnfTransformation,[status(thm)],[f_36]) ).
tff(c_9,plain,
~ $less(f(f('#skF_1')),f($sum(2,f('#skF_1')))),
inference(backgroundSimplification,[status(thm),theory('LRFIA')],[c_2]) ).
tff(c_13,plain,
f('#skF_1') = '#skE_1',
inference(define,[status(thm),theory(equality)],[c_9]) ).
tff(c_11,plain,
~ $less(f(f('#skF_1')),f($sum(2,f('#skF_1')))),
inference(backgroundSimplification,[status(thm),theory('LRFIA')],[c_2]) ).
tff(c_23,plain,
~ $less(f('#skE_1'),f($sum(2,'#skE_1'))),
inference(demodulation,[status(thm),theory(equality)],[c_13,c_13,c_11]) ).
tff(c_74,plain,
f($sum(2,'#skE_1')) = '#skE_3',
inference(define,[status(thm),theory(equality)],[c_23]) ).
tff(c_73,plain,
f('#skE_1') = '#skE_2',
inference(define,[status(thm),theory(equality)],[c_23]) ).
tff(c_72,plain,
~ $less(f('#skE_1'),f($sum(2,'#skE_1'))),
inference(demodulation,[status(thm),theory(equality)],[c_13,c_13,c_11]) ).
tff(c_85,plain,
~ $less('#skE_2','#skE_3'),
inference(demodulation,[status(thm),theory(equality)],[c_74,c_73,c_72]) ).
tff(c_157,plain,
f($sum(2,'#skE_1')) = '#skE_3',
inference(define,[status(thm),theory(equality)],[c_23]) ).
tff(c_88,plain,
f('#skE_1') = '#skE_2',
inference(define,[status(thm),theory(equality)],[c_23]) ).
tff(c_5,plain,
! [U_1a: $int,V_2a: $int] :
( $less(f(U_1a),f(V_2a))
| ~ $less(U_1a,V_2a) ),
inference(cnfTransformation,[status(thm)],[f_36]) ).
tff(c_126,plain,
! [V_2a: $int] :
( $less('#skE_2',f(V_2a))
| ~ $less('#skE_1',V_2a) ),
inference(superposition,[status(thm),theory(equality)],[c_88,c_5]) ).
tff(c_196,plain,
( $less('#skE_2','#skE_3')
| ~ $less('#skE_1',$sum(2,'#skE_1')) ),
inference(superposition,[status(thm),theory(equality)],[c_157,c_126]) ).
tff(c_198,plain,
$less('#skE_2','#skE_3'),
inference(backgroundSimplification,[status(thm),theory('LIA')],[c_196]) ).
tff(c_222,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_85,c_198]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : ARI183_1 : TPTP v9.0.0. Released v5.0.0.
% 0.11/0.13 % 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.34 % Computer : n023.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Mon Apr 7 15:04:39 EDT 2025
% 0.12/0.34 % CPUTime :
% 2.95/1.72 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.95/1.72
% 2.95/1.72 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------