%------------------------------------------------------------------------------
% File : Beagle---0.9.52
% Problem : CSR004+2 : TPTP v9.0.0. Bugfixed v3.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 : n013.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:53:21 PM UTC 2025
% Result : Theorem 5.61s 2.25s
% Output : CNFRefutation 5.61s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 4
% Syntax : Number of formulae : 11 ( 8 unt; 0 typ; 0 def)
% Number of atoms : 19 ( 3 equ)
% Maximal formula atoms : 6 ( 1 avg)
% Number of connectives : 13 ( 5 ~; 4 |; 3 &)
% ( 1 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 14 ( 12 usr; 1 prp; 0-4 aty)
% Number of functors : 28 ( 28 usr; 15 con; 0-3 aty)
% Number of variables : 3 ( 3 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ trajectory > antitrajectory > terminates > stoppedIn > startedIn > releases > initiates > releasedAt > less_or_equal > less > holdsAt > happens > plus > #nlpp > waterLevel > tapOn > tapOff > spilling > overflow > n9 > n8 > n7 > n6 > n5 > n4 > n3 > n2 > n1 > n0 > filling > #skF_6 > #skF_1 > #skF_4 > #skF_2 > #skF_8 > #skF_11 > #skF_9 > #skF_3 > #skF_7 > #skF_5 > #skF_10
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(less_or_equal,type,
less_or_equal: ( $i * $i ) > $o ).
tff('#skF_6',type,
'#skF_6': ( $i * $i ) > $i ).
tff(stoppedIn,type,
stoppedIn: ( $i * $i * $i ) > $o ).
tff('#skF_1',type,
'#skF_1': ( $i * $i * $i ) > $i ).
tff(terminates,type,
terminates: ( $i * $i * $i ) > $o ).
tff(releasedAt,type,
releasedAt: ( $i * $i ) > $o ).
tff(n8,type,
n8: $i ).
tff(n9,type,
n9: $i ).
tff('#skF_4',type,
'#skF_4': ( $i * $i * $i ) > $i ).
tff(startedIn,type,
startedIn: ( $i * $i * $i ) > $o ).
tff(n3,type,
n3: $i ).
tff(trajectory,type,
trajectory: ( $i * $i * $i * $i ) > $o ).
tff(n1,type,
n1: $i ).
tff(less,type,
less: ( $i * $i ) > $o ).
tff(plus,type,
plus: ( $i * $i ) > $i ).
tff(n7,type,
n7: $i ).
tff(n6,type,
n6: $i ).
tff('#skF_2',type,
'#skF_2': ( $i * $i * $i ) > $i ).
tff(n0,type,
n0: $i ).
tff('#skF_8',type,
'#skF_8': ( $i * $i ) > $i ).
tff(antitrajectory,type,
antitrajectory: ( $i * $i * $i * $i ) > $o ).
tff('#skF_11',type,
'#skF_11': ( $i * $i * $i ) > $i ).
tff(spilling,type,
spilling: $i ).
tff(happens,type,
happens: ( $i * $i ) > $o ).
tff(filling,type,
filling: $i ).
tff(initiates,type,
initiates: ( $i * $i * $i ) > $o ).
tff(n4,type,
n4: $i ).
tff('#skF_9',type,
'#skF_9': ( $i * $i * $i ) > $i ).
tff(tapOff,type,
tapOff: $i ).
tff('#skF_3',type,
'#skF_3': ( $i * $i * $i ) > $i ).
tff(releases,type,
releases: ( $i * $i * $i ) > $o ).
tff(tapOn,type,
tapOn: $i ).
tff(waterLevel,type,
waterLevel: $i > $i ).
tff(holdsAt,type,
holdsAt: ( $i * $i ) > $o ).
tff('#skF_7',type,
'#skF_7': ( $i * $i ) > $i ).
tff(n2,type,
n2: $i ).
tff(overflow,type,
overflow: $i ).
tff(n5,type,
n5: $i ).
tff('#skF_5',type,
'#skF_5': ( $i * $i ) > $i ).
tff('#skF_10',type,
'#skF_10': ( $i * $i * $i ) > $i ).
tff(f_386,negated_conjecture,
~ happens(overflow,n3),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',overflow_3) ).
tff(f_384,lemma,
holdsAt(filling,n3),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',filling_3) ).
tff(f_383,lemma,
holdsAt(waterLevel(n3),n3),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',waterLevel_3) ).
tff(f_270,axiom,
! [Event,Time] :
( happens(Event,Time)
<=> ( ( ( Event = tapOn )
& ( Time = n0 ) )
| ( holdsAt(waterLevel(n3),Time)
& holdsAt(filling,Time)
& ( Event = overflow ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/CSR001+1.ax',happens_all_defn) ).
tff(c_275,plain,
~ happens(overflow,n3),
inference(cnfTransformation,[status(thm)],[f_386]) ).
tff(c_273,plain,
holdsAt(filling,n3),
inference(cnfTransformation,[status(thm)],[f_384]) ).
tff(c_271,plain,
holdsAt(waterLevel(n3),n3),
inference(cnfTransformation,[status(thm)],[f_383]) ).
tff(c_1056,plain,
! [Time_176] :
( ~ holdsAt(filling,Time_176)
| ~ holdsAt(waterLevel(n3),Time_176)
| happens(overflow,Time_176) ),
inference(cnfTransformation,[status(thm)],[f_270]) ).
tff(c_1059,plain,
( ~ holdsAt(filling,n3)
| happens(overflow,n3) ),
inference(resolution,[status(thm)],[c_271,c_1056]) ).
tff(c_1062,plain,
happens(overflow,n3),
inference(demodulation,[status(thm),theory(equality)],[c_273,c_1059]) ).
tff(c_1064,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_275,c_1062]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : CSR004+2 : TPTP v9.0.0. Bugfixed v3.1.0.
% 0.10/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.12/0.33 % Computer : n013.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 16:32:17 EDT 2025
% 0.12/0.33 % CPUTime :
% 5.61/2.25 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 5.61/2.25
% 5.61/2.25 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------