%------------------------------------------------------------------------------
% File : Beagle---0.9.52
% Problem : CSR021+1 : 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 : n014.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:23 PM UTC 2025
% Result : Theorem 10.95s 3.50s
% Output : CNFRefutation 10.95s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 6
% Syntax : Number of formulae : 17 ( 9 unt; 0 typ; 0 def)
% Number of atoms : 54 ( 24 equ)
% Maximal formula atoms : 19 ( 3 avg)
% Number of connectives : 57 ( 20 ~; 17 |; 17 &)
% ( 2 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 4 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 : 24 ( 24 usr; 15 con; 0-3 aty)
% Number of variables : 21 ( 21 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ trajectory > antitrajectory > terminates > stoppedIn > startedIn > releases > initiates > releasedAt > less_or_equal > less > holdsAt > happens > plus > #nlpp > spinning > push > pull > n9 > n8 > n7 > n6 > n5 > n4 > n3 > n2 > n1 > n0 > forwards > backwards > #skF_6 > #skF_1 > #skF_4 > #skF_2 > #skF_8 > #skF_3 > #skF_7 > #skF_5
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(backwards,type,
backwards: $i ).
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(forwards,type,
forwards: $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(happens,type,
happens: ( $i * $i ) > $o ).
tff(initiates,type,
initiates: ( $i * $i * $i ) > $o ).
tff(n4,type,
n4: $i ).
tff(pull,type,
pull: $i ).
tff('#skF_3',type,
'#skF_3': ( $i * $i * $i ) > $i ).
tff(releases,type,
releases: ( $i * $i * $i ) > $o ).
tff(holdsAt,type,
holdsAt: ( $i * $i ) > $o ).
tff(push,type,
push: $i ).
tff('#skF_7',type,
'#skF_7': ( $i * $i ) > $i ).
tff(n2,type,
n2: $i ).
tff(n5,type,
n5: $i ).
tff(spinning,type,
spinning: $i ).
tff('#skF_5',type,
'#skF_5': ( $i * $i ) > $i ).
tff(f_301,axiom,
! [Event,Time] :
( happens(Event,Time)
<=> ( ( ( Event = push )
& ( Time = n0 ) )
| ( ( Event = pull )
& ( Time = n1 ) )
| ( ( Event = pull )
& ( Time = n2 ) )
| ( ( Event = push )
& ( Time = n2 ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/CSR001+2.ax',happens_all_defn) ).
tff(f_391,negated_conjecture,
~ ~ holdsAt(backwards,n3),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',not_backwards_3) ).
tff(f_280,axiom,
! [Event,Fluent,Time] :
( terminates(Event,Fluent,Time)
<=> ( ( ( Event = push )
& ( Fluent = backwards )
& ~ happens(pull,Time) )
| ( ( Event = pull )
& ( Fluent = forwards )
& ~ happens(push,Time) )
| ( ( Event = pull )
& ( Fluent = forwards )
& happens(push,Time) )
| ( ( Event = pull )
& ( Fluent = backwards )
& happens(push,Time) )
| ( ( Event = push )
& ( Fluent = spinning )
& ~ happens(pull,Time) )
| ( ( Event = pull )
& ( Fluent = spinning )
& ~ happens(push,Time) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/CSR001+2.ax',terminates_all_defn) ).
tff(f_319,axiom,
plus(n1,n2) = n3,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',plus1_2) ).
tff(f_325,axiom,
! [X,Y] : ( plus(X,Y) = plus(Y,X) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',symmetry_of_plus) ).
tff(f_174,axiom,
! [Event,Time,Fluent] :
( ( happens(Event,Time)
& terminates(Event,Fluent,Time) )
=> ~ holdsAt(Fluent,plus(Time,n1)) ),
file('/export/starexec/sandbox/benchmark/Axioms/CSR001+0.ax',happens_terminates_not_holds) ).
tff(c_1616,plain,
happens(push,n2),
inference(cnfTransformation,[status(thm)],[f_301]) ).
tff(c_1618,plain,
happens(pull,n2),
inference(cnfTransformation,[status(thm)],[f_301]) ).
tff(c_1712,plain,
holdsAt(backwards,n3),
inference(cnfTransformation,[status(thm)],[f_391]) ).
tff(c_1574,plain,
! [Time_58] :
( ~ happens(push,Time_58)
| terminates(pull,backwards,Time_58) ),
inference(cnfTransformation,[status(thm)],[f_280]) ).
tff(c_1642,plain,
plus(n1,n2) = n3,
inference(cnfTransformation,[status(thm)],[f_319]) ).
tff(c_1652,plain,
! [Y_65,X_64] : ( plus(Y_65,X_64) = plus(X_64,Y_65) ),
inference(cnfTransformation,[status(thm)],[f_325]) ).
tff(c_4018,plain,
! [Fluent_219,Time_220,Event_221] :
( ~ holdsAt(Fluent_219,plus(Time_220,n1))
| ~ terminates(Event_221,Fluent_219,Time_220)
| ~ happens(Event_221,Time_220) ),
inference(cnfTransformation,[status(thm)],[f_174]) ).
tff(c_8672,plain,
! [Fluent_428,X_429,Event_430] :
( ~ holdsAt(Fluent_428,plus(n1,X_429))
| ~ terminates(Event_430,Fluent_428,X_429)
| ~ happens(Event_430,X_429) ),
inference(superposition,[status(thm),theory(equality)],[c_1652,c_4018]) ).
tff(c_8728,plain,
! [Fluent_433,Event_434] :
( ~ holdsAt(Fluent_433,n3)
| ~ terminates(Event_434,Fluent_433,n2)
| ~ happens(Event_434,n2) ),
inference(superposition,[status(thm),theory(equality)],[c_1642,c_8672]) ).
tff(c_8740,plain,
( ~ holdsAt(backwards,n3)
| ~ happens(pull,n2)
| ~ happens(push,n2) ),
inference(resolution,[status(thm)],[c_1574,c_8728]) ).
tff(c_8765,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_1616,c_1618,c_1712,c_8740]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.11 % Problem : CSR021+1 : TPTP v9.0.0. Bugfixed v3.1.0.
% 0.07/0.12 % 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.13/0.33 % Computer : n014.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 300
% 0.13/0.33 % DateTime : Mon Apr 7 16:34:19 EDT 2025
% 0.13/0.33 % CPUTime :
% 10.95/3.50 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 10.95/3.51
% 10.95/3.51 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------