%------------------------------------------------------------------------------
% File : Beagle---0.9.52
% Problem : SYP116_1 : TPTP v9.3.0. Released v9.3.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 : n011.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 May 5 07:09:53 PM UTC 2026
% Result : Unsatisfiable 2.66s 1.62s
% Output : CNFRefutation 2.66s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 6
% Syntax : Number of formulae : 24 ( 9 unt; 0 typ; 0 def)
% Number of atoms : 42 ( 3 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 29 ( 11 ~; 9 |; 3 &)
% ( 0 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 2 avg)
% Maximal term depth : 1 ( 1 avg)
% Number arithmetic : 34 ( 15 atm; 0 fun; 15 num; 4 var)
% Number of types : 2 ( 0 usr; 1 ari)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 8 ( 3 usr; 2 prp; 0-2 aty)
% Number of functors : 3 ( 2 usr; 3 con; 0-0 aty)
% Number of variables : 4 ( 4 !; 0 ?; 4 :)
% Comments :
%------------------------------------------------------------------------------
%$ r > q > p > #nlpp
%Foreground sorts:
%Background operators:
tff(npa,type,
npa: $int ).
tff(npb,type,
npb: $int ).
%Foreground operators:
tff(q,type,
q: $int > $o ).
tff(p,type,
p: $int > $o ).
tff(r,type,
r: $int > $o ).
tff(f_58,axiom,
! [Xa: $int] :
( $true
=> r(Xa) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax6) ).
tff(f_53,axiom,
! [Xa: $int] :
( ( ( npa != npb )
& r(Xa) )
=> $false ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax5) ).
tff(f_37,axiom,
( $greatereq(npb,0)
=> p(npb) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax2) ).
tff(f_46,axiom,
( $less(npb,0)
=> q(npb) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax4) ).
tff(f_42,axiom,
( ( $less(npa,0)
& q(npa) )
=> $false ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax3) ).
tff(f_33,axiom,
( ( $greatereq(npa,0)
& p(npa) )
=> $false ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax1) ).
tff(c_10,plain,
! [X_2a: $int] : r(X_2a),
inference(cnfTransformation,[status(thm)],[f_58]) ).
tff(c_11,plain,
! [X_1a: $int] :
( ~ r(X_1a)
| ( npb = npa ) ),
inference(cnfTransformation,[status(thm)],[f_53]) ).
tff(c_34,plain,
npb = npa,
inference(demodulation,[status(thm),theory(equality)],[c_10,c_11]) ).
tff(c_3,plain,
( p(npb)
| ~ $greatereq(npb,0) ),
inference(cnfTransformation,[status(thm)],[f_37]) ).
tff(c_23,plain,
( p(npb)
| $less(npb,0) ),
inference(backgroundSimplification,[status(thm),theory('LRFIA')],[c_3]) ).
tff(c_49,plain,
( p(npa)
| $less(npa,0) ),
inference(demodulation,[status(thm),theory(equality)],[c_34,c_34,c_23]) ).
tff(c_55,plain,
$less(npa,0),
inference(splitLeft,[status(thm)],[c_49]) ).
tff(c_15,plain,
( q(npb)
| ~ $less(npb,0) ),
inference(cnfTransformation,[status(thm)],[f_46]) ).
tff(c_40,plain,
( q(npa)
| ~ $less(npa,0) ),
inference(demodulation,[status(thm),theory(equality)],[c_34,c_34,c_15]) ).
tff(c_66,plain,
q(npa),
inference(demodulation,[status(thm),theory(equality)],[c_55,c_40]) ).
tff(c_19,plain,
( ~ q(npa)
| ~ $less(npa,0) ),
inference(cnfTransformation,[status(thm)],[f_42]) ).
tff(c_69,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_55,c_66,c_19]) ).
tff(c_75,plain,
~ $less(npa,0),
inference(splitRight,[status(thm)],[c_49]) ).
tff(c_77,plain,
p(npa),
inference(splitRight,[status(thm)],[c_49]) ).
tff(c_1,plain,
( ~ p(npa)
| ~ $greatereq(npa,0) ),
inference(cnfTransformation,[status(thm)],[f_33]) ).
tff(c_27,plain,
( ~ p(npa)
| $less(npa,0) ),
inference(backgroundSimplification,[status(thm),theory('LRFIA')],[c_1]) ).
tff(c_80,plain,
$less(npa,0),
inference(demodulation,[status(thm),theory(equality)],[c_77,c_27]) ).
tff(c_81,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_75,c_80]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SYP116_1 : TPTP v9.3.0. Released v9.3.0.
% 0.12/0.13 % 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.17/0.34 % Computer : n011.cluster.edu
% 0.17/0.34 % Model : x86_64 x86_64
% 0.17/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.34 % Memory : 8042.1875MB
% 0.17/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.17/0.34 % CPULimit : 300
% 0.17/0.34 % WCLimit : 300
% 0.17/0.34 % DateTime : Mon May 4 17:50:32 EDT 2026
% 0.17/0.35 % CPUTime :
% 2.66/1.62 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.66/1.62
% 2.66/1.62 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------