TSTP Solution File: CSR017+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : CSR017+1 : TPTP v8.1.2. Bugfixed v3.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 : n002.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 Aug 22 10:35:33 EDT 2023
% Result : Theorem 8.63s 3.08s
% Output : CNFRefutation 8.63s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 48
% Syntax : Number of formulae : 92 ( 32 unt; 36 typ; 0 def)
% Number of atoms : 118 ( 48 equ)
% Maximal formula atoms : 19 ( 2 avg)
% Number of connectives : 103 ( 41 ~; 37 |; 18 &)
% ( 6 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 55 ( 21 >; 34 *; 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 : 35 (; 34 !; 1 ?; 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_334,axiom,
~ ? [X] : less(X,n0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',less0) ).
tff(f_378,axiom,
! [X,Y] :
( less(X,Y)
<=> ( ~ less(Y,X)
& ( Y != X ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',less_property) ).
tff(f_304,axiom,
push != pull,
file('/export/starexec/sandbox2/benchmark/Axioms/CSR001+2.ax',push_not_pull) ).
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/sandbox2/benchmark/Axioms/CSR001+2.ax',happens_all_defn) ).
tff(f_331,axiom,
! [X,Y] :
( less_or_equal(X,Y)
<=> ( less(X,Y)
| ( X = Y ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',less_or_equal) ).
tff(f_338,axiom,
! [X] :
( less(X,n1)
<=> less_or_equal(X,n0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',less1) ).
tff(f_391,negated_conjecture,
~ ~ holdsAt(spinning,n1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',not_spinning_1) ).
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/sandbox2/benchmark/Axioms/CSR001+2.ax',terminates_all_defn) ).
tff(f_315,axiom,
plus(n0,n1) = n1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',plus0_1) ).
tff(f_174,axiom,
! [Event,Time,Fluent] :
( ( happens(Event,Time)
& terminates(Event,Fluent,Time) )
=> ~ holdsAt(Fluent,plus(Time,n1)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/CSR001+0.ax',happens_terminates_not_holds) ).
tff(f_342,axiom,
! [X] :
( less(X,n2)
<=> less_or_equal(X,n1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',less2) ).
tff(f_318,axiom,
plus(n1,n1) = n2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',plus1_1) ).
tff(c_1660,plain,
! [X_68] : ~ less(X_68,n0),
inference(cnfTransformation,[status(thm)],[f_334]) ).
tff(c_1700,plain,
! [Y_79] : ~ less(Y_79,Y_79),
inference(cnfTransformation,[status(thm)],[f_378]) ).
tff(c_1624,plain,
push != pull,
inference(cnfTransformation,[status(thm)],[f_304]) ).
tff(c_1622,plain,
happens(push,n0),
inference(cnfTransformation,[status(thm)],[f_301]) ).
tff(c_1656,plain,
! [Y_67] : less_or_equal(Y_67,Y_67),
inference(cnfTransformation,[status(thm)],[f_331]) ).
tff(c_1877,plain,
! [X_106] :
( less(X_106,n1)
| ~ less_or_equal(X_106,n0) ),
inference(cnfTransformation,[status(thm)],[f_338]) ).
tff(c_1882,plain,
less(n0,n1),
inference(resolution,[status(thm)],[c_1656,c_1877]) ).
tff(c_1712,plain,
holdsAt(spinning,n1),
inference(cnfTransformation,[status(thm)],[f_391]) ).
tff(c_1572,plain,
! [Time_58] :
( happens(pull,Time_58)
| terminates(push,spinning,Time_58) ),
inference(cnfTransformation,[status(thm)],[f_280]) ).
tff(c_1634,plain,
plus(n0,n1) = n1,
inference(cnfTransformation,[status(thm)],[f_315]) ).
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_4990,plain,
! [Fluent_268,Event_269] :
( ~ holdsAt(Fluent_268,n1)
| ~ terminates(Event_269,Fluent_268,n0)
| ~ happens(Event_269,n0) ),
inference(superposition,[status(thm),theory(equality)],[c_1634,c_4018]) ).
tff(c_4994,plain,
( ~ holdsAt(spinning,n1)
| ~ happens(push,n0)
| happens(pull,n0) ),
inference(resolution,[status(thm)],[c_1572,c_4990]) ).
tff(c_5017,plain,
happens(pull,n0),
inference(demodulation,[status(thm),theory(equality)],[c_1622,c_1712,c_4994]) ).
tff(c_1602,plain,
! [Time_63,Event_62] :
( ( n1 = Time_63 )
| ( n2 = Time_63 )
| ( push = Event_62 )
| ~ happens(Event_62,Time_63) ),
inference(cnfTransformation,[status(thm)],[f_301]) ).
tff(c_5037,plain,
( ( n1 = n0 )
| ( n2 = n0 )
| ( push = pull ) ),
inference(resolution,[status(thm)],[c_5017,c_1602]) ).
tff(c_5048,plain,
( ( n1 = n0 )
| ( n2 = n0 ) ),
inference(negUnitSimplification,[status(thm)],[c_1624,c_5037]) ).
tff(c_5055,plain,
n2 = n0,
inference(splitLeft,[status(thm)],[c_5048]) ).
tff(c_1767,plain,
! [X_90] :
( less(X_90,n2)
| ~ less_or_equal(X_90,n1) ),
inference(cnfTransformation,[status(thm)],[f_342]) ).
tff(c_1772,plain,
less(n1,n2),
inference(resolution,[status(thm)],[c_1656,c_1767]) ).
tff(c_1899,plain,
! [Y_110,X_111] :
( ~ less(Y_110,X_111)
| ~ less(X_111,Y_110) ),
inference(cnfTransformation,[status(thm)],[f_378]) ).
tff(c_1926,plain,
~ less(n2,n1),
inference(resolution,[status(thm)],[c_1772,c_1899]) ).
tff(c_5082,plain,
~ less(n0,n1),
inference(demodulation,[status(thm),theory(equality)],[c_5055,c_1926]) ).
tff(c_5100,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_1882,c_5082]) ).
tff(c_5101,plain,
n1 = n0,
inference(splitRight,[status(thm)],[c_5048]) ).
tff(c_1620,plain,
happens(pull,n1),
inference(cnfTransformation,[status(thm)],[f_301]) ).
tff(c_1574,plain,
! [Time_58] :
( ~ happens(push,Time_58)
| terminates(pull,backwards,Time_58) ),
inference(cnfTransformation,[status(thm)],[f_280]) ).
tff(c_1640,plain,
plus(n1,n1) = n2,
inference(cnfTransformation,[status(thm)],[f_318]) ).
tff(c_4876,plain,
! [Fluent_260,Event_261] :
( ~ holdsAt(Fluent_260,n2)
| ~ terminates(Event_261,Fluent_260,n1)
| ~ happens(Event_261,n1) ),
inference(superposition,[status(thm),theory(equality)],[c_1640,c_4018]) ).
tff(c_4884,plain,
( ~ holdsAt(backwards,n2)
| ~ happens(pull,n1)
| ~ happens(push,n1) ),
inference(resolution,[status(thm)],[c_1574,c_4876]) ).
tff(c_4905,plain,
( ~ holdsAt(backwards,n2)
| ~ happens(push,n1) ),
inference(demodulation,[status(thm),theory(equality)],[c_1620,c_4884]) ).
tff(c_4917,plain,
~ happens(push,n1),
inference(splitLeft,[status(thm)],[c_4905]) ).
tff(c_5104,plain,
~ happens(push,n0),
inference(demodulation,[status(thm),theory(equality)],[c_5101,c_4917]) ).
tff(c_5151,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_1622,c_5104]) ).
tff(c_5153,plain,
happens(push,n1),
inference(splitRight,[status(thm)],[c_4905]) ).
tff(c_1596,plain,
! [Time_63,Event_62] :
( ( n0 = Time_63 )
| ( pull = Event_62 )
| ( n2 = Time_63 )
| ~ happens(Event_62,Time_63) ),
inference(cnfTransformation,[status(thm)],[f_301]) ).
tff(c_5203,plain,
( ( n1 = n0 )
| ( push = pull )
| ( n2 = n1 ) ),
inference(resolution,[status(thm)],[c_5153,c_1596]) ).
tff(c_5213,plain,
( ( n1 = n0 )
| ( n2 = n1 ) ),
inference(negUnitSimplification,[status(thm)],[c_1624,c_5203]) ).
tff(c_5218,plain,
n2 = n1,
inference(splitLeft,[status(thm)],[c_5213]) ).
tff(c_5278,plain,
less(n1,n1),
inference(demodulation,[status(thm),theory(equality)],[c_5218,c_1772]) ).
tff(c_5295,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_1700,c_5278]) ).
tff(c_5296,plain,
n1 = n0,
inference(splitRight,[status(thm)],[c_5213]) ).
tff(c_5332,plain,
less(n0,n0),
inference(demodulation,[status(thm),theory(equality)],[c_5296,c_1882]) ).
tff(c_5346,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_1660,c_5332]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.17 % Problem : CSR017+1 : TPTP v8.1.2. Bugfixed v3.1.0.
% 0.13/0.18 % 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.14/0.40 % Computer : n002.cluster.edu
% 0.14/0.40 % Model : x86_64 x86_64
% 0.14/0.40 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.40 % Memory : 8042.1875MB
% 0.14/0.40 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.40 % CPULimit : 300
% 0.14/0.40 % WCLimit : 300
% 0.14/0.40 % DateTime : Thu Aug 3 20:57:47 EDT 2023
% 0.14/0.40 % CPUTime :
% 8.63/3.08 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 8.63/3.08
% 8.63/3.08 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 8.63/3.11
% 8.63/3.11 Inference rules
% 8.63/3.11 ----------------------
% 8.63/3.11 #Ref : 0
% 8.63/3.11 #Sup : 627
% 8.63/3.11 #Fact : 2
% 8.63/3.11 #Define : 0
% 8.63/3.11 #Split : 31
% 8.63/3.11 #Chain : 0
% 8.63/3.11 #Close : 0
% 8.63/3.11
% 8.63/3.11 Ordering : KBO
% 8.63/3.11
% 8.63/3.11 Simplification rules
% 8.63/3.11 ----------------------
% 8.63/3.11 #Subsume : 736
% 8.63/3.11 #Demod : 577
% 8.63/3.11 #Tautology : 499
% 8.63/3.11 #SimpNegUnit : 156
% 8.63/3.11 #BackRed : 434
% 8.63/3.11
% 8.63/3.11 #Partial instantiations: 0
% 8.63/3.11 #Strategies tried : 1
% 8.63/3.11
% 8.63/3.11 Timing (in seconds)
% 8.63/3.11 ----------------------
% 8.63/3.12 Preprocessing : 0.83
% 8.63/3.12 Parsing : 0.31
% 8.63/3.12 CNF conversion : 0.08
% 8.63/3.12 Main loop : 1.14
% 8.63/3.12 Inferencing : 0.32
% 8.63/3.12 Reduction : 0.37
% 8.63/3.12 Demodulation : 0.24
% 8.63/3.12 BG Simplification : 0.13
% 8.63/3.12 Subsumption : 0.32
% 8.63/3.12 Abstraction : 0.03
% 8.63/3.12 MUC search : 0.00
% 8.63/3.12 Cooper : 0.00
% 8.63/3.12 Total : 2.02
% 8.63/3.12 Index Insertion : 0.00
% 8.63/3.12 Index Deletion : 0.00
% 8.63/3.12 Index Matching : 0.00
% 8.63/3.12 BG Taut test : 0.00
%------------------------------------------------------------------------------